197 search results - page 1 / 40 » Complexity of Max-SAT using stochastic algorithms |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
DISOPT
2011
12 years 12 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
ICAART
2010
INSTICC
14 years 1 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
IEEEARES
2006
IEEE
13 years 11 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
SAC
2008
ACM
13 years 4 months ago
2008
ACM
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...