2108 search results - page 110 / 422 » Constrained Heuristic Search |
COMPSAC
2004
IEEE
15 years 5 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
15 years 3 months 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...
100
click to vote
COMBINATORICS
1998
15 years 1 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...
101
click to vote
AIPS
2007
15 years 4 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 ...
136
click to vote
AGENTS
2001
Springer
15 years 6 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...