Sciweavers

1592 search results - page 134 / 319
» The state of the email address
Sort
View
UAI
2004
14 years 8 hour ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
WSC
2001
14 years 7 hour ago
On improving the performance of simulation-based algorithms for average reward processes with application to network pricing
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
Enrique Campos-Náñez, Stephen D. Pat...
AIPS
2000
14 years 7 min 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
AIPS
1998
13 years 12 months ago
Making Forward Chaining Relevant
Planning by forward chaining through the world space has long been dismissed as being "obviously" infeasible. Nevertheless, this approach to planning has many advantages...
Fahiem Bacchus, Yee Whye Teh
UAI
2003
13 years 12 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller