3049 search results - page 328 / 610 » On the Convergence of Bound Optimization Algorithms |
137
click to vote
ICAPR
2005
Springer
16 years 6 days ago
2005
Springer
A non-dominated sorting genetic algorithm is used to evolve models of learning from different theories for multiple tasks. Correlation analysis is performed to identify parameters...
204
click to vote
ICANN
2001
Springer
15 years 11 months ago
2001
Springer
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
174
click to vote
EPS
1998
Springer
15 years 11 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
180
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
169
click to vote
IEAAIE
1994
Springer
15 years 10 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...