264 search results - page 38 / 53 » On the possibility of faster SAT algorithms |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...
CG
2006
Springer
15 years 1 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
AAAI
2010
14 years 11 months ago
2010
Many machine learning applications that involve relational databases incorporate first-order logic and probability. Markov Logic Networks (MLNs) are a prominent statistical relati...
115
click to vote
ISPD
2012
ACM
13 years 5 months ago
2012
ACM
Importance sampling is a popular approach to estimate rare event failures of SRAM cells. We propose to improve importance sampling by probability collectives. First, we use “Kul...
BMCBI
2007
14 years 10 months ago
2007
Background: We have developed a new haplotyping program based on the combination of an iterative multiallelic EM algorithm (IEM), bootstrap resampling and a pseudo Gibbs sampler. ...