Sciweavers

800 search results - page 31 / 160
» On the Complexity of Parity Games
Sort
View
EWCBR
2008
Springer
13 years 11 months ago
Visualizing and Evaluating Complexity of Textual Case Bases
We present an approach to visualize textual case bases by "stacking" similar cases and features close to each other in an image derived from the casefeature matrix. We pr...
Sutanu Chakraborti, Ulises Cerviño Beresi, ...
CAV
2003
Springer
160views Hardware» more  CAV 2003»
14 years 2 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
AI
2006
Springer
13 years 9 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
ICML
2004
IEEE
14 years 10 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
ATAL
2009
Springer
14 years 3 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge