533 search results - page 26 / 107 » Playing games with approximation algorithms |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
ICANN
2005
Springer
14 years 2 months ago
2005
Springer
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
TACAS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
GAMEON
2007
13 years 10 months ago
2007
Nowadays it is not uncommon for computer games to be used as tools to help introduce basic computer science concepts. In this paper we argue that games could also be used in more ...
JAIR
2010
13 years 7 months ago
2010
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...