Results 201 to 210 of about 54,333 (259)

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
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

Home - About - Disclaimer - Privacy