Sciweavers

1041 search results - page 74 / 209
» Randomizing Reductions of Search Problems
Sort
View
SAT
2009
Springer
91views Hardware» more  SAT 2009»
14 years 2 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
GECCO
2004
Springer
14 years 1 months ago
Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
Gerry V. Dozier, Hurley Cunningham, Winard Britt, ...
AUSDM
2008
Springer
246views Data Mining» more  AUSDM 2008»
13 years 10 months ago
Comparison of Visualization Methods of Genome-wide SNP Profiles in Childhood Acute Lymphoblastic Leukaemia
Data mining and knowledge discovery have been applied to datasets in various industries including biomedical data. Modelling, data mining and visualization in biomedical data addr...
Ahmad Al-Oqaily, Paul J. Kennedy, Daniel R. Catchp...
EUROSYS
2006
ACM
14 years 5 months ago
Ferret: a toolkit for content-based similarity search of feature-rich data
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
Qin Lv, William Josephson, Zhe Wang, Moses Charika...
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman