78 search results - page 7 / 16 » Local Search Algorithms for Partial MAXSAT |
AAAI
2006
15 years 1 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
100
Voted
FGR
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract— This paper proposes a sparsity driven shape registration method for occluded facial feature localization. Most current shape registration methods search landmark locati...
WSC
2008
15 years 2 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
110
click to vote
JSAT
2008
14 years 12 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...