Sciweavers

763 search results - page 86 / 153
» Engineering Shortest Path Algorithms
Sort
View
COLOGNETWENTE
2008
13 years 11 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze
DAC
1994
ACM
14 years 1 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
14 years 4 months ago
Dynamic visibility checking for vision-based motion planning
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
Simon Léonard, Elizabeth A. Croft, James J....
ICC
2007
IEEE
130views Communications» more  ICC 2007»
14 years 4 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 3 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...