202 search results - page 30 / 41 » Admissible Heuristics for Optimal Planning |
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
CP
1998
Springer
13 years 11 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
TAPAS
2011
13 years 2 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 7 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 2 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...