8025 search results - page 1293 / 1605 » Combinators Introduction: An Algorithm |
163
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...
196
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...
182
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...
242
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 ...
181
click to vote
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....