658 search results - page 113 / 132 » Lower bounds for sorting networks |
IPPS
2000
IEEE
14 years 1 days 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
2010
ACM
13 years 11 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
We consider the setting of a network providing differentiated services. As is often the case in differentiated services, we assume that the packets are tagged as either being a hi...
WG
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
CCCG
2008
13 years 9 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...