454 search results - page 52 / 91 » On improving approximate solutions by evolutionary algorithm... |
118
click to vote
ENC
2005
IEEE
15 years 7 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
ACL
2007
15 years 3 months ago
2007
This paper proposes a novel approach to the induction of Combinatory Categorial Grammars (CCGs) by their potential affinity with the Genetic Algorithms (GAs). Specifically, CCGs...
126
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
NIPS
2008
15 years 3 months ago
2008
We show how improved sequences for magnetic resonance imaging can be found through optimization of Bayesian design scores. Combining approximate Bayesian inference and natural ima...
129
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...