Sciweavers

1999 search results - page 203 / 400
» Finding Reductions Automatically
Sort
View
JAIR
2008
130views more  JAIR 2008»
15 years 1 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
JAIR
2006
115views more  JAIR 2006»
15 years 1 months ago
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
Yixin Chen, Benjamin W. Wah, Chih-Wei Hsu
119
Voted
JGTOOLS
2006
111views more  JGTOOLS 2006»
15 years 1 months ago
Stochastic Billboard Clouds for Interactive Foliage Rendering
We render tree foliage levels of detail (LODs) using a new adaptation of billboard clouds. Our contributions are a simple and efficient billboard cloud creation algorithm designed...
J. Dylan Lacewell, David Edwards, Peter Shirley, W...
LISP
2008
96views more  LISP 2008»
15 years 1 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
MAM
2006
124views more  MAM 2006»
15 years 1 months ago
Design optimization and space minimization considering timing and code size via retiming and unfolding
The increasingly complicated DSP processors and applications with strict timing and code size constraints require design automation tools to consider multiple optimizations such a...
Qingfeng Zhuge, Chun Xue, Zili Shao, Meilin Liu, M...