74 search results - page 15 / 15 » Boolean Games Revisited |
87
Voted
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
105
click to vote
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
126
click to vote
AI
2008
Springer
15 years 17 days ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
106
Voted
AI
2002
Springer
15 years 9 days 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...