1639 search results - page 84 / 328 » Anytime Heuristic Search |
104
click to vote
AI
2006
Springer
15 years 20 days ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
92
Voted
COMBINATORICS
1998
15 years 8 days ago
1998
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
92
Voted
AIPS
2007
15 years 2 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
121
Voted
AGENTS
2001
Springer
15 years 5 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
113
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...