113 search results - page 20 / 23 » On bounded occurrence constraint satisfaction |
AAAI
2008
13 years 10 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
AAAI
2010
13 years 9 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
TECS
2010
13 years 6 months ago
2010
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...