Sciweavers

315 search results - page 41 / 63
» Shortest path optimization under limited information
Sort
View
ADHOC
2010
317views more  ADHOC 2010»
13 years 4 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
INFOCOM
2003
IEEE
14 years 1 months ago
Sensor-Centric Quality of Routing in Sensor Networks
Abstract— Standard embeded sensor nework models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two ...
Rajgopal Kannan, Sudipta Sarangi, S. Sitharama Iye...
CIKM
2003
Springer
14 years 1 months ago
The power-method: a comprehensive estimation technique for multi-dimensional queries
Existing estimation approaches for multi-dimensional databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias
AI
2011
Springer
13 years 2 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
SIGCOMM
2012
ACM
11 years 10 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey