179 search results - page 26 / 36 » An LP-Based Heuristic for Optimal Planning |
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
12 years 11 months ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
TAPAS
2011
13 years 3 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
AUTOMATICA
2006
13 years 8 months ago
2006
While risk-sensitive (RS) approaches for designing plans of total productive maintenance are critical in manufacturing systems, there is little in the literature by way of theoret...
TSMC
2010
13 years 3 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
PODS
2002
ACM
14 years 8 months ago
2002
ACM
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...