23590 search results - page 477 / 4718 » Algorithm Performance Contest |
136
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
123
click to vote
ICARIS
2005
Springer
15 years 10 months ago
2005
Springer
An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent abso...
104
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
167
click to vote
WIRN
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
124
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...