10 search results - page 2 / 2 » Optimal myopic algorithms for random 3-SAT |
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
Active learning methods aim to select the most informative unlabeled instances to label first, and can help to focus image or video annotations on the examples that will most impr...
DAM
2008
13 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
SAT
2010
Springer
13 years 4 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
JSAC
2010
13 years 4 months ago
2010
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
DSP
2006
13 years 6 months ago
2006
This paper considers the problem of sensor scheduling for the purposes of detection and tracking of "smart" targets. Smart targets are targets that can detect when they ...