First Page | Document Content | |
---|---|---|
![]() Date: 2013-06-23 23:45:38Diophantine approximation Monte Carlo methods Operations research Low-discrepancy sequence Quasi-Monte Carlo method Halton sequence Algorithm Travelling salesman problem Dynamic programming Mathematics Applied mathematics Numerical analysis | Source URL: www.genetic-programming.orgDownload Document from Source WebsiteFile Size: 632,50 KBShare Document on Facebook |
![]() | From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min ChenDocID: 1renq - View Document |
![]() | 120 IEEE TRANSACTIONS ON INFORMAnON THEORY,VOL.IT-25,NO.DocID: 1n2vh - View Document |
![]() | Algorithmic Construction of Low-Discrepancy Point Sets via Dependent Randomized Rounding Benjamin Doerra , Michael Gnewuchb , Magnus Wahlstr¨oma a Max-Planck-Institut f¨DocID: 1k85r - View Document |
![]() | Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples Benjamin Doerr, Michael Gnewuch, and Magnus Wahlstr¨om Abstract In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. MoDocID: 1jLP8 - View Document |
![]() | PDF DocumentDocID: 1j2Pt - View Document |