Sciweavers

1662 search results - page 51 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
HIS
2004
13 years 10 months ago
Zamin, an Agent Based Artificial Life Model
Zamin artificial life model is designed to be a general purpose environment for researches on evolution of learning methods, living strategies and complex behaviors and is used in ...
Ramin Halavati, Saeed Bagheri Shouraki, Saman Hara...
CSE
2009
IEEE
14 years 3 months ago
Implementing Social Norms Using Policies
—Multi-agent systems are difficult to develop. One reason for this is that agents are embedded in a society where all agents must agree to obey certain social norms in order for...
Robert Kremer
ATAL
2010
Springer
13 years 10 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
JCSS
2010
112views more  JCSS 2010»
13 years 7 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
GRC
2008
IEEE
13 years 10 months ago
Granular Problem Solving and Software Engineering
Granulation is an important component of Granular Computing (GrC) as a problem solving paradigm. Specification and regulation of granulation are necessary in helping researchers a...
Haibin Zhu