3780 search results - page 176 / 756 » Algorithms for Game Metrics |
121
click to vote
ECCC
2006
15 years 5 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...
179
click to vote
ICASSP
2011
IEEE
14 years 8 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...
133
click to vote
COCO
2005
Springer
15 years 10 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...
112
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classi...
144
click to vote
TACAS
2009
Springer
15 years 12 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 ...