12194 search results - page 435 / 2439 » Numberings Optimal for Learning |
268
Voted
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
149
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
180
click to vote
IPL
2008
15 years 6 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
183
click to vote
PRL
2008
15 years 6 months ago
2008
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
168
click to vote
FUIN
2010
15 years 4 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...