971 search results - page 34 / 195 » Approximate Satisfiability and Equivalence |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
SIGPRO
2011
13 years 4 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
IDEAS
2005
IEEE
14 years 3 months ago
2005
IEEE
Traditional approaches to query processing aim at rewriting a given query into another more efficient one that uses less time and/or resources during the execution. There by, the...
PRICAI
2000
Springer
14 years 1 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
AAIM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...