Sciweavers

1662 search results - page 104 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ECAI
2004
Springer
14 years 2 months ago
Focusing Reasoning Through Emotional Mechanisms
Abstract. In concrete environments, where uncertainty and dynamism are pervasive and time and resources are limited, reasoning and decision-making processes raise important problem...
Luís Morgado, Graça Gaspar
ATAL
2010
Springer
13 years 10 months ago
Evolving policy geometry for scalable multiagent learning
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
David B. D'Ambrosio, Joel Lehman, Sebastian Risi, ...
JSAC
2008
140views more  JSAC 2008»
13 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
ATAL
2006
Springer
14 years 21 days ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
CVIU
2007
193views more  CVIU 2007»
13 years 9 months ago
Interpretation of complex scenes using dynamic tree-structure Bayesian networks
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
Sinisa Todorovic, Michael C. Nechyba