501 search results - page 13 / 101 » Scheduling Abstractions for Local Search |
SLS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a software tool, called EasySyn++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EasySyn++ uses C++ as ...
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper presents a SVM-based local search (SVM-LS) approach to the problem of gene selection and classification of microarray data. The proposed approach is highlighte...
PREMI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
ICNC
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
IDA
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...