Sciweavers

424 search results - page 31 / 85
» Scheduled Hot-Potato Routing
Sort
View
MOBIHOC
2005
ACM
15 years 11 months ago
Timed grid routing (TIGR) bites off energy
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...
Roy Friedman, Guy Korland
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 1 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
CP
1998
Springer
15 years 4 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
AHSWN
2010
130views more  AHSWN 2010»
14 years 12 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
EOR
2010
110views more  EOR 2010»
14 years 12 months ago
Online scheduling policies for multiclass call centers with impatient customers
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
Oualid Jouini, Auke Pot, Ger Koole, Yves Dallery