Sciweavers

473 search results - page 49 / 95
» Computing shortest paths with uncertainty
Sort
View
ICNP
1999
IEEE
15 years 2 months ago
Policy Disputes in Path-Vector Protocols
The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Internet. As required of any interdomain protocol, BGP allows policy-based met...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
CVPR
1996
IEEE
15 years 1 months ago
Global Minimum for Active Contour Models: A Minimal Path Approach
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model's energy between two end points. Initialization is ...
Laurent D. Cohen, Ron Kimmel
APPT
2007
Springer
15 years 3 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
IJRR
2008
75views more  IJRR 2008»
14 years 9 months ago
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
Jur P. van den Berg, Mark H. Overmars
ICCAD
2003
IEEE
140views Hardware» more  ICCAD 2003»
15 years 6 months ago
Block-based Static Timing Analysis with Uncertainty
Static timing analysis is a critical step in design of any digital integrated circuit. Technology and design trends have led to significant increase in environmental and process v...
Anirudh Devgan, Chandramouli V. Kashyap