3495 search results - page 390 / 699 » On the random satisfiable process |
199
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
190
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
151
click to vote
AAAI
2006
15 years 8 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
155
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...