373 search results - page 33 / 75 » On Deterministic Approximation of DNF |
GI
2009
Springer
13 years 5 months ago
2009
Springer
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
TCS
2002
13 years 7 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...