914 search results - page 49 / 183 » The Computational Complexity of Probabilistic Planning |
ICCV
2005
IEEE
15 years 17 days ago
2005
IEEE
In this paper, we address the issue of extracting contour of the object with a specific shape. A hierarchical graphical model is proposed to represent shape variations. A complex ...
ESOP
2005
Springer
14 years 4 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
ATAL
2009
Springer
14 years 5 months ago
2009
Springer
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
JMLR
2010
13 years 5 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
PG
2002
IEEE
14 years 3 months ago
2002
IEEE
Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, suc...