Sciweavers

71 search results - page 9 / 15
» Partial Order Reduction for Probabilistic Branching Time
Sort
View
AIPS
2006
14 years 11 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
ECAI
2006
Springer
15 years 1 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
IEEEPACT
1999
IEEE
15 years 1 months ago
Predicated Static Single Assignment
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural m...
Lori Carter, Beth Simon, Brad Calder, Larry Carter...
65
Voted
JAPLL
2008
88views more  JAPLL 2008»
14 years 9 months ago
Living up to one's commitments: Agency, strategies and trust
In human social interaction, the notions of commitment and trust are strongly interrelated. A formal model for this interrelation will enable artificial agents to benefit from the...
Thomas Müller
CVPR
2007
IEEE
15 years 11 months ago
Recognizing Human Activities from Silhouettes: Motion Subspace and Factorial Discriminative Graphical Model
We describe a probabilistic framework for recognizing human activities in monocular video based on simple silhouette observations in this paper. The methodology combines kernel pr...
Liang Wang, David Suter