17760 search results - page 261 / 3552 » A Generalization of the Massey-Ding Algorithm |
148
click to vote
WSC
2004
15 years 8 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
188
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
172
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
175
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
154
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...