9572 search results - page 1604 / 1915 » Cover Algorithms and Their Combination |
172
click to vote
AIPS
2007
15 years 9 months ago
2007
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
161
click to vote
FLAIRS
2007
15 years 9 months ago
2007
There is a growing interest in producing story based game experiences that do not follow fixed scripts predefined by the author, but change the experience based on actions perfo...
194
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
181
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
240
Voted
WSC
2008
15 years 9 months ago
2008
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...