Sciweavers

91 search results - page 7 / 19
» Optimal Retiming for Initial State Computation
Sort
View
QUESTA
2010
89views more  QUESTA 2010»
14 years 8 months ago
Asymptotically optimal importance sampling for Jackson networks with a tree topology
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...
Ali Devin Sezer
AIPS
2000
14 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
ICCS
2007
Springer
15 years 4 months ago
Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
Omar Bashir, Omar Ghattas, Judith Hill, Bart G. va...
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
ECP
1997
Springer
125views Robotics» more  ECP 1997»
15 years 2 months ago
Possibilistic Planning: Representation and Complexity
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
Célia da Costa Pereira, Frédé...