Sciweavers

236 search results - page 32 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
149
Voted
INFOCOM
2008
IEEE
16 years 14 days ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
TMC
2008
83views more  TMC 2008»
15 years 6 months ago
A Swarm-Intelligence-Based Protocol for Data Acquisition in Networks with Mobile Sinks
This paper addresses the problem of data acquisition in ad hoc and sensor networks with mobile sinks and proposes a protocol based on swarm intelligence, SIMPLE, to route data in s...
Hua Yang, Fengji Ye, Biplab Sikdar
FOCS
1994
IEEE
15 years 10 months ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
158
Voted
TPDS
1998
78views more  TPDS 1998»
15 years 5 months ago
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
Rajendra V. Boppana, Suresh Chalasani, C. S. Ragha...
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 9 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler