First Page | Document Content | |
---|---|---|
Date: 2004-09-20 19:09:48Error detection and correction Metaheuristics Coding theory Information theory Simulated annealing Constant-weight code Algorithm ReedSolomon error correction Mathematical optimization Local search Hill climbing Huffman coding | Add to Reading ListSource URL: isl.stanford.eduDownload Document from Source WebsiteFile Size: 991,76 KBShare Document on Facebook |
A Statistical Analysis of the Features of a Hybrid Local Search Algorithm For Course Timetabling Problems Ruggero Bellio1 and Luca Di Gaspero2 , Andrea Schaerf2 1DocID: 1rklx - View Document | |
JMLR: Workshop and Conference Proceedings vol 40:1–26, 2015 Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions Alexandre Belloni The Fuqua School of Business, Duke UniverDocID: 1r9WD - View Document | |
030101v00 [Modo de compatibilidad]DocID: 1r8IR - View Document | |
CrossMark_Color_Stacked_pDocID: 1qqbf - View Document | |
Parallel Evolutionary Algorithms Chapter in the Handbook of Computational Intelligence edited by Janusz Kacprzyk and Witold Pedrycz Dirk Sudholt University of Sheffield, UKDocID: 1qmrs - View Document |