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...
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuv...
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...
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...
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 ...
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...