Sciweavers

12194 search results - page 2137 / 2439
» cans 2010
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
AAAI
2010
15 years 8 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
AAAI
2010
15 years 8 months ago
Informed Lifting for Message-Passing
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
Kristian Kersting, Youssef El Massaoudi, Fabian Ha...
AAAI
2010
15 years 8 months ago
Recognizing Multi-Agent Activities from GPS Data
Recent research has shown that surprisingly rich models of human behavior can be learned from GPS (positional) data. However, most research to date has concentrated on modeling si...
Adam Sadilek, Henry A. Kautz
AAAI
2010
15 years 8 months ago
PUMA: Planning Under Uncertainty with Macro-Actions
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
Ruijie He, Emma Brunskill, Nicholas Roy
« Prev « First page 2137 / 2439 Last » Next »