1662 search results - page 63 / 333 » The Computational Complexity of Agent Design Problems |
GI
2007
Springer
14 years 3 months ago
2007
Springer
: State-of-the-art interoperability between heterogeneous systems on a technical level builds on services oriented architectures (SOA) for a given problem space. Semantics can be i...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
JCIT
2008
13 years 8 months ago
2008
Lack of time and capital for software testing is an oft encountered problem in most organizations. The plethora of possible test cases for each software component makes software t...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper presents a framework that integrates three aspects of agency: planning, for proactive behaviour, negotiation, for social behaviour and resource achievement, an...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we study multi-agent economic systems using a recent approach to economic modeling called Agent-based Computational Economics (ACE): the application of the Complex ...