1615 search results - page 79 / 323 » Pathology in heuristic search |
COMPSAC
2004
IEEE
14 years 2 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
GRAPHICSINTERFACE
1997
14 years 16 days ago
1997
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
COMBINATORICS
1998
13 years 11 months 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...
AIPS
2007
14 years 1 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 ...
AGENTS
2001
Springer
14 years 3 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...