840 search results - page 35 / 168 » An Interactive Approach to Route Search |
JCM
2007
13 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
GECCO
2003
Springer
14 years 28 days ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
Motivated by the commonly used faceted search interface in e-commerce, this paper investigates interactive relevance feedback mechanism based on faceted document metadata. In this...
ANTSW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study through simulation the performance of two MANET routing algorithms in a realistic urban environment. The two algorithms, AODV and AntHocNet, are representative o...
UIST
2010
ACM
13 years 5 months ago
2010
ACM
Twitter streams are on overload: active users receive hundreds of items per day, and existing interfaces force us to march through a chronologically-ordered morass to find tweets ...