Sciweavers

247 search results - page 37 / 50
» Optimal Preemptive Scheduling for General Target Functions
Sort
View
157
Voted
IJCGA
2010
155views more  IJCGA 2010»
15 years 1 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
SPAA
1993
ACM
15 years 7 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
192
Voted
CRV
2005
IEEE
342views Robotics» more  CRV 2005»
15 years 5 months ago
PDE-Based Robust Robotic Navigation
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
M. Sabry Hassouna, Alaa E. Abdel-Hakim, Aly A. Far...
115
Voted
ICPR
2004
IEEE
16 years 4 months ago
Shape Metamorphism using p-Laplacian Equation
We present a new approach for shape metamorphism, which is a process of gradually changing a source shape (known) through intermediate shapes (unknown) into a target shape (known)...
Bahram Parvin, Ge Cong, George Bebis, Mehmet Esser
CGO
2003
IEEE
15 years 8 months ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz