Sciweavers

150 search results - page 3 / 30
» Graphical models for online solutions to interactive POMDPs
Sort
View
ATAL
2007
Springer
13 years 12 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
SI3D
2012
ACM
12 years 1 months ago
4D parametric motion graphs for interactive animation
A 4D parametric motion graph representation is presented for interactive animation from actor performance capture in a multiple camera studio. The representation is based on a 4D ...
Dan Casas, Margara Tejera, Jean-Yves Guillemaut, A...
ATAL
2004
Springer
13 years 11 months ago
Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
Dmitri A. Dolgov, Edmund H. Durfee
AIPS
2000
13 years 7 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
AAAI
2010
13 years 7 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos