28 search results - page 3 / 6 » An asymptotic Lower Bound for the Maximal Number of Runs in ... |
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—The problem of cooperative allocation among multiple secondary users to maximize cognitive system throughput is considered. The channel availability statistics are initi...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...