First Page | Document Content | |
---|---|---|
![]() Date: 2005-09-20 15:21:30Analysis Convex function Annealing Simulated annealing Mathematical optimization Tikhonov regularization Regularization Convex set Convex analysis Mathematics Mathematical analysis | Source URL: www.cs.cornell.eduDownload Document from Source WebsiteFile Size: 245,65 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 |