Guile Mailing List Archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Well, that's interesting.
>> Various programs would be run, and re-run with a different
>> order of the functions, trying to optimize short jumps. A
>> simulated annealing search would then guide you to the optimal
Klaus> May the one implemented in the GNU scientific library be
Klaus> used? It also uses SimAn-search.
That's why he was talking to me about it. The interface to these
search methods (genetic algorithms, simulated annealing, ...) is quite
generic, and it would be easy to do.
Guile Home |
Main Index |