45 search results - page 9 / 9 » ERA: An Algorithm for Reducing the Epistasis of SAT Problems |
SIAMCOMP
1998
13 years 4 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
BMCBI
2008
13 years 5 months ago
2008
Background: Amino acid sequence probability distributions, or profiles, have been used successfully to predict secondary structure and local structure in proteins. Profile models ...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
KR
2004
Springer
13 years 10 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
DAC
2008
ACM
14 years 6 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...