708 search results - page 32 / 142 » Timing closure: the solution and its problems |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Real-world multi-objective engineering design optimization problems often have parameters with uncontrollable variations. The aim of solving such problems is to obtain solutions t...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
JAIR
2006
14 years 10 months ago
2006
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper we present an approach to obstacle avoidance and local path planning for polygonal robots. It decomposes the task into a model stage and a planning stage. The model ...