Sciweavers

8094 search results - page 90 / 1619
» Improvements in Formula Generalization
Sort
View
JMLR
2010
148views more  JMLR 2010»
13 years 3 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
ICCV
2007
IEEE
14 years 11 months ago
Differential EMD Tracking
Illumination changes cause object appearance to change drastically and many existing tracking algorithms lack the capability to handle this problem. The Earth Mover's Distanc...
Qi Zhao, Shane Brennan, Hai Tao
DAC
2001
ACM
14 years 10 months ago
Dynamic Detection and Removal of Inactive Clauses in SAT with Application in Image Computation
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
Aarti Gupta, Anubhav Gupta, Zijiang Yang, Pranav A...
CSR
2007
Springer
14 years 3 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
ICTAI
2006
IEEE
14 years 3 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...