17760 search results - page 126 / 3552 » A Generalization of the Massey-Ding Algorithm |
106
click to vote
AAAI
2007
15 years 6 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
151
click to vote
APN
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
122
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
133
Voted
AAAI
2010
15 years 5 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
120
Voted
NIPS
2007
15 years 5 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...