Sciweavers

552 search results - page 32 / 111
» Constrained Shortest Path Computation
Sort
View
IWCMC
2009
ACM
14 years 4 months ago
Energy penalties for non-shortest paths in wireless sensor networks with link failures
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...
Geir Egeland, Paal E. Engelstad
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 4 days 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
ISVD
2007
IEEE
14 years 4 months ago
Time Convex Hull with a Highway
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
Teng-Kai Yu, D. T. Lee
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
13 years 8 months ago
Computing push plans for disk-shaped robots
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
Mark de Berg, Dirk H. P. Gerrits
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...