Sciweavers

10907 search results - page 100 / 2182
» Constraint Based Strategies
Sort
View
PDP
2003
IEEE
15 years 3 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
ENGL
2007
91views more  ENGL 2007»
14 years 9 months ago
RRT-based strategies for sensor-based exploration
—Real mobile robots should be able to build an abstract representation of the physical environment, in order to navigate and to work in such environment. We present a method for ...
Abraham Sánchez López, Judith Le&oac...
CAD
1998
Springer
14 years 9 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
IROS
2008
IEEE
91views Robotics» more  IROS 2008»
15 years 4 months ago
Replanning: A powerful planning strategy for hard kinodynamic problems
— A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, ofï...
Konstantinos I. Tsianos, Lydia E. Kavraki
ICRA
2005
IEEE
117views Robotics» more  ICRA 2005»
15 years 3 months ago
Optimal Positioning Strategies for Shape Changes in Robot Teams
Abstract— In this paper, we consider the task of repositioning a formation of robots to a new shape while minimizing either the maximum distance that any robot travels, or the to...
John R. Spletzer, Rafael B. Fierro