Sciweavers

408 search results - page 55 / 82
» A lookahead strategy for solving large planning problems
Sort
View
SI3D
2010
ACM
15 years 4 months ago
Volumetric obscurance
Obscurance and Ambient Occlusion (AO) are popular techniques in both film and games that model how ambient light is shadowed. While it is largely a solved problem for static scen...
Bradford James Loos, Peter-Pike Sloan
JNSM
2008
130views more  JNSM 2008»
14 years 9 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
CP
2005
Springer
15 years 3 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
EOR
2006
65views more  EOR 2006»
14 years 9 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
AGI
2008
14 years 11 months ago
Temporal Action Logic for Question Answering in an Adventure Game
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
Martin Magnusson, Patrick Doherty