1350 search results - page 114 / 270 » Generalized Committed Choice |
169
Voted
NIPS
1992
15 years 5 months ago
1992
This paper describes a technique for learning both the number of states and the topologyof Hidden Markov Models from examples. The inductionprocess starts with the most specific m...
106
click to vote
VMV
2007
15 years 5 months ago
2007
The core of most registration algorithms aligns scan data by pairs, minimizing their relative distance. This local optimization must generally pass through a validation procedure t...
154
click to vote
GECCO
2008
Springer
15 years 5 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...
137
Voted
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Existing macro systems force programmers to make a choice between clarity of specification and robustness. If they choose clarity, they must forgo validating significant parts of ...
159
click to vote
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...