14084 search results - page 2657 / 2817 » A Theory for Game Theories |
178
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
148
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
157
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
169
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...
157
click to vote
AUSDM
2006
Springer
15 years 10 months ago
2006
Springer
The purpose of this study is to demonstrate the benefit of using common data mining techniques on survey data where statistical analysis is routinely applied. The statistical surv...