Sciweavers

2082 search results - page 146 / 417
» Change Paths in Reasoning!
Sort
View
CAAN
2006
Springer
14 years 1 months ago
Distributed Routing in Tree Networks with Few Landmarks
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...
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtz...
WSC
2007
14 years 16 days ago
Project planning using an interactive, structured modeling environment
Planning construction projects typically makes use of the activity network based Critical Path Method (CPM), since it is very simple to use and reasonably versatile. Most other pl...
Ian Flood
CORR
2010
Springer
299views Education» more  CORR 2010»
13 years 10 months ago
A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks
Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. I...
Mehdi Lotfi, Sam Jabbehdari, Majid Asadi Shahmirza...
ICDCS
2010
IEEE
13 years 8 months ago
Safe and Stabilizing Distributed Cellular Flows
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
Taylor Johnson, Sayan Mitra, Karthik Manamcheri
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
13 years 8 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev