Sciweavers

2343 search results - page 88 / 469
» The Locomotive Routing Problem
Sort
View
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 1 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
ATAL
2009
Springer
14 years 4 months ago
Context-aware multi-stage routing
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
Adriaan ter Mors, Jeroen van Belle, Cees Witteveen
ATMOS
2010
163views Optimization» more  ATMOS 2010»
13 years 9 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
ICCCN
2007
IEEE
14 years 4 months ago
Reduce IP Address Fragmentation through Allocation
— The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting el...
Mei Wang, Larry Dunn, Wei Mao, Tao Chen
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
14 years 4 months ago
Multi-robot routing under limited communication range
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
Alejandro R. Mosteo, Luis Montano, Michail G. Lago...