Sciweavers

277 search results - page 19 / 56
» New results on shortest paths in three dimensions
Sort
View
INFOCOM
2003
IEEE
14 years 29 days ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
ICRA
2000
IEEE
150views Robotics» more  ICRA 2000»
14 years 2 days ago
Path Planning in Image Space for Robust Visual Servoing
Vision feedback control loop techniques are efficient for a great class of applications but they come up against difficulties when the initial and desired positions of the camer...
Youcef Mezouar, François Chaumette
ICCAD
2006
IEEE
130views Hardware» more  ICCAD 2006»
14 years 4 months ago
On bounding the delay of a critical path
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
Leonard Lee, Li-C. Wang
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 5 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
MST
2002
152views more  MST 2002»
13 years 7 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir