Strategies for a massively parallel implementation of simulated annealing
Si trova su / Altri legami
Massively parallel implementations of simulated annealing algorithms to solve NP–complete combinatorial problems are discussed. All solutions are based upon the processor farm model, where each worker tries a distinct rearrangement to improve the current solution
| # | Istituto/Sede | Collocazione | Inventario patrimoniale |
|---|---|---|---|
| Area della ricerca di Genova, Servizio di Documentazione Scientifica | Sede di Genova |
