Sciweavers

27692 search results - page 100 / 5539
» Where is ...
Sort
View
IJCAI
1989
13 years 10 months ago
A Maneuvering-Board Approach to Path Planning with Moving Obstacles
In this paper we describe a new approach to the problem of path planning with moving obstacles. Our approach is based on the maneuvering board method commonly used for nautical na...
Lou Tychonievich, David Zaret, John Mantegna, Robe...
WCE
2007
13 years 10 months ago
Robot Motion Planning using Hyperboloid Potential Functions
—A new approach to robot path planning using hyperboloid potential functions is presented in this paper. Unlike parabolic potential functions, where the control force increases w...
A. Badawy, Colin R. McInnes
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 9 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
13 years 9 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld
CJ
2010
128views more  CJ 2010»
13 years 9 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...