589 search results - page 43 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
171
click to vote
WADS
2009
Springer
16 years 24 days ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
122
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
151
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
156
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents an evaluation of evolved term-weighting schemes on short, medium and long TREC queries. A previously evolved global (collection-wide) term-weighting scheme is ...
180
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...