Sciweavers

2796 search results - page 200 / 560
» The coolest path problem
Sort
View
CONPAR
1992
15 years 10 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
ICCAD
1995
IEEE
136views Hardware» more  ICCAD 1995»
15 years 10 months ago
A controller-based design-for-testability technique for controller-data path circuits
This paper investigates the effect of the controller on the testability of sequential circuits composed of controllers and data paths. It is shown that even when both the controll...
Sujit Dey, Vijay Gangaram, Miodrag Potkonjak
IJCAI
1997
15 years 8 months ago
Scaling the Dynamic Approach to Autonomous Path Planning: Planning Horizon Dynamics
In the dynamical systems approach to robot path planning both sensed and remembered information contribute to shape a nonlinear vector eld that governs the behavior of an autonomo...
Edward W. Large, Henrik I. Christensen, Ruzena Baj...
ICRA
1993
IEEE
104views Robotics» more  ICRA 1993»
15 years 10 months ago
Numerical Determination of Optimal Non-Holonomic Paths in the Presence of Obstacles
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
Sudhaker Samuel, S. Sathiya Keerthi
COMPGEOM
1990
ACM
15 years 10 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...