190 search results - page 9 / 38 » Isomorph-Free Exhaustive Generation |
102
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
124
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
FSE
2007
Springer
15 years 8 months ago
2007
Springer
Two general attacks that can be applied to all versions and variants of the Pomaranch stream cipher are presented. The attacks are demonstrated on all versions and succeed with com...
131
Voted
SIGMOD
2000
ACM
15 years 6 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
JAIR
2007
15 years 1 months ago
2007
This paper is concerned with a class of algorithms that perform exhaustive search on propositional knowledge bases. We show that each of these algorithms defines and generates a ...