890 search results - page 87 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
156
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
165
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
207
click to vote
KSEM
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
150
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
156
click to vote
ICCBR
2007
Springer
16 years 14 days ago
2007
Springer
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...