914 search results - page 110 / 183 » Branch and Bound on the Network Model |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
101
click to vote
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
–- To obtain optimal location area (LA) partitioning in cellular radio networks is important since it maximizes the usable bandwidth to support services. However, we feel that th...
MSWIM
2004
ACM
15 years 3 months ago
2004
ACM
— Providing delay guarantees to time-sensitive traffic in future wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the vari...
WG
2000
Springer
15 years 1 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...