79 search results - page 10 / 16 » Strategies for Solving SAT in Grids by Randomized Search |
111
Voted
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
ECAI
2004
Springer
15 years 2 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
ICA3PP
2005
Springer
15 years 3 months ago
2005
Springer
In the present work we describe architectural concepts of the distributed molecular simulation package GridMD. The main purpose of this work is to underline the construction patter...
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...