1547 search results - page 214 / 310 » Randomized Variable Elimination |
107
click to vote
STACS
2004
Springer
15 years 8 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
100
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Recent progress in per-pixel object class labeling of natural images can be attributed to the use of multiple types of image features and sound statistical learning approaches. Wit...
124
Voted
ICDCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
127
click to vote
EMO
2001
Springer
15 years 7 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
133
click to vote
AAAI
2008
15 years 5 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...