6095 search results - page 86 / 1219 » Learning in Local Search |
CPAIOR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
CPAIOR
2007
Springer
14 years 3 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
DATE
2003
IEEE
14 years 2 months ago
2003
IEEE
We propose a method for local search of Boolean relations relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze ...
BIBM
2009
IEEE
14 years 24 days ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
CP
2006
Springer
14 years 16 days ago
2006
Springer
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...