3928 search results - page 310 / 786 » Optimal suffix selection |
129
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
157
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
—We propose a new parametric class of scheduling and routing policies for open multiclass queueing networks. We establish their stability and show they are amenable to distribute...
177
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
159
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, a new method for assigning credit to search operators is presented. Starting with the principle of optimizing search bias, search operators are selected based on an...
175
click to vote
NIPS
2003
15 years 8 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...