Sciweavers

810 search results - page 98 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AGI
2008
13 years 9 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
EOR
2010
93views more  EOR 2010»
13 years 8 months ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
JAIR
2008
145views more  JAIR 2008»
13 years 8 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
IPPS
1998
IEEE
14 years 8 days ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
AAAI
2010
13 years 9 months ago
Generalized Task Markets for Human and Machine Computation
We discuss challenges and opportunities for developing generalized task markets where human and machine intelligence are enlisted to solve problems, based on a consideration of th...
Dafna Shahaf, Eric Horvitz