1599 search results - page 114 / 320 » Algorithms for Parity Games |
156
click to vote
ECCC
2006
15 years 6 months ago
2006
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
208
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose the energy efficient MAC algorithm in this paper. In the proposed algorithm, each node sets the contention window size with respect to the residual energy, the harvest...
155
click to vote
COCO
2005
Springer
16 years 1 days 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...
165
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
142
click to vote
AMC
2008
15 years 6 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...