197 search results - page 14 / 40 » Advances in Local Search for Satisfiability |
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
AAAI
2006
13 years 9 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...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
BMCBI
2011
13 years 2 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...