1016 search results - page 116 / 204 » Optimized algorithms for multi-agent routing |
165
click to vote
ICPPW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
171
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
206
click to vote
ALGOSENSORS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
183
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
175
click to vote
EOR
2007
15 years 6 months ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...