1639 search results - page 83 / 328 » Anytime Heuristic Search |
107
click to vote
AI
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
COMPSAC
2004
IEEE
15 years 4 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 1 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...
82
Voted
AIPS
1998
15 years 1 months ago
1998
We present the application of the Planning by Rewriting PbR framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for e cient high-quali...
130
click to vote
JMLR
2006
15 years 16 days ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...