Results 201 to 210 of about 56,182 (260)

Protocol for rapid allelic discrimination qPCR genotyping of the Winnie mouse model. [PDF]

STAR Protoc
Mansoori B, Liang C.
europepmc   +1 more source

Enhancement of LTE and NR systems through efficient physical cell identity allocation. [PDF]

Sci Rep
Farghaly SI, Khayal HM, Algohary IM, Eissa MA, Elsheikh MH, Alnashar PE, Alfakhrany RS, Alkhuoty RS, Abo-Alsayed AS.   +8 more
europepmc   +1 more source

Universal dense-open windows for generic conservative surface semigroups and graph-directed local systems

Shmalo Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Theorem about the Channel Assignment Problem

SIAM Journal on Discrete Mathematics, 2003
Summary: A list channel assignment problem is a triple \((G,L,w)\), where \(G\) is a graph, \(L\) is a function which assigns to each vertex of \(G\) a list of integers (colors), and \(w\) is a function which assigns to each edge of \(G\) a positive integer (its weight).
Riste Škrekovski, Daniel Kral
exaly   +2 more sources

The Channel Assignment Problem

1983 IEEE Symposium on Security and Privacy, 1983
An optimization problem exists in the context of local area network security. The network provides a number of physical or logical "channels", each carrying a set of levels or compartments of information. A channel is accessible to users cleared for all the levels it carries.
Bahaa W. Fam, Jonathan K. Millen
openaire   +1 more source

Optimal channel pin assignment

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
The authors study the channel pin assignment (CPA) problem subject to position constraints, order constraints, and separation constraints. The problem is to assign two sets of terminals to the top and the bottom of a channel to minimize channel density.
Yang Cai 0003, Martin D. F. Wong
openaire   +1 more source

Channel assignment on strongly-simplicial graphs

Proceedings International Parallel and Distributed Processing Symposium, 2004
Given a vector ( 1; 2; : : : ; t) of non increasing pos- itive integers, and an undirected graph G = (V;E), an L( 1; 2; : : : ; t)-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that jf(u) -- f(v)j i, if d(u; v) = i; 1 i t; where d(u; v) is the distance (i.e. the minimum num- ber of edges) between the vertices
Bertossi, A. A., Pinotti, M. C., Rizzi, R.   +2 more
openaire   +4 more sources

On the 2-Dimensional Channel Assignment Problem

IEEE Transactions on Computers, 1984
We consider the 2-dimensional channel assignment problem: given a set S of iso-oriented rectangles (whose sides are parallel to the coordinate axes), find a minimum number of planes (channels) to which only nonoverlapping rectangles are assigned. This problem is equivalent to the coloring problem of the rectangle intersection graph G = (V, E), in which
D. T. Lee, Joseph Y.-T. Leung
openaire   +2 more sources

An Optimal Solution for the Channel-Assignment Problem

IEEE Transactions on Computers, 1979
Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a Θ(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling.
Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung   +2 more
openaire   +2 more sources

Random access channel assignment on a collision erasure channel

2020 Information Theory and Applications Workshop (ITA), 2020
Channel assignment for wireless radios employing random access is found in several contexts, including low-power wide area network (LPWAN) protocols such as LoRaWAN. This paper considers the assignment of a set of N radios to M available channels with the objective of maximizing the sum throughput.
Abhinanda Dutta, Steven Weber 0001
openaire   +1 more source