589 search results - page 25 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
JAIR
2006
13 years 7 months ago
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
Clustering for better representation of the diversity of text or image search results has been studied extensively. In this paper, we extend this methodology to the novel domain o...