553 search results - page 62 / 111 » On Planar Path Transformation |
112
click to vote
SIGSOFT
2003
ACM
16 years 17 days ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
117
click to vote
ESSLLI
2009
Springer
14 years 9 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
104
click to vote
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create s...
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...