806 search results - page 136 / 162 » Lower Bounds on Correction Networks |
INFOCOM
2000
IEEE
14 years 1 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
14 years 1 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 11 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...
ANOR
2007
13 years 10 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
COMCOM
2006
13 years 10 months ago
2006
The coordinated coexistence of WLANs and WPANs in a dual-mode network is a recently introduced idea and is expected to increase the overall system performance by allowing for the ...