4488 search results - page 77 / 898 » Focusing Search by Using Problem Solving Experience |
141
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 8 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
182
click to vote
TMM
2010
14 years 10 months ago
2010
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
144
click to vote
AIPS
2007
15 years 5 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
128
click to vote
PPL
2010
14 years 10 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
166
click to vote
AROBOTS
2002
15 years 3 months ago
2002
The potential field method is widely used for autonomous mobile robot path planning due to its elegant mathematical analysis and simplicity. However, most researches have been focu...