10568 search results - page 1742 / 2114 » Computer Intelligence and Formalization |
171
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
148
click to vote
AI
2008
Springer
15 years 5 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
148
Voted
AI
2002
Springer
15 years 4 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
178
Voted
ACRI
2010
Springer
15 years 3 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
158
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
Computer systems increasingly carry out tasks in mixed networks, that is in group settings in which they interact both with other computer systems and with people. Participants in...