Sciweavers

227 search results - page 17 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
99
Voted
ICRA
2006
IEEE
143views Robotics» more  ICRA 2006»
15 years 5 months ago
Evaluation of a Large Scale Pervasive Embedded Network for Robot Path Planning
— We investigate a technique that uses an embedded network deployed pervasively throughout an environment to aid robots in navigation. First, we show that the path computed by th...
Keith J. O'Hara, Victor Bigio, Shaun Whitt, Daniel...
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 16 days ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
MOBICOM
2003
ACM
15 years 4 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 1 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
78
Voted
EDBT
2006
ACM
120views Database» more  EDBT 2006»
15 years 11 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...