<--- Back to Details
First PageDocument Content
Diophantine 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
Date: 2013-06-23 23:45:38
Diophantine 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

Add to Reading List

Source URL: www.genetic-programming.org

Download Document from Source Website

File Size: 632,50 KB

Share Document on Facebook

Similar Documents

Diophantine approximation, scalar multiplication and decidability Philipp Hieronymi University of Illinois at Urbana-Champaign Colloquium Logicum 2016

DocID: 1uMMV - View Document

Roth’s Theorem: an introduction to diophantine approximation Michael Nakamaye June 18,

DocID: 1tdN5 - View Document

ON FRACTAL MEASURES AND DIOPHANTINE APPROXIMATION DMITRY KLEINBOCK, ELON LINDENSTRAUSS, AND BARAK WEISS Abstract. We study diophantine properties of a typical point with respect to measures on Rn . Namely, we identify ge

DocID: 1sqGR - View Document

THE ABC CONJECTURE AND PRIME DIVISORS OF THE LUCAS AND LEHMER SEQUENCES RAM MURTY AND SIMAN WONG 1. Introduction A straightforward consequence of Thue’s pioneering work on Diophantine approximation [24] is: Let m be a

DocID: 1snVy - View Document

Mathematics / Mathematical analysis / Diophantine approximation / Low-discrepancy sequence / Numerical analysis / Quasirandomness / Random number generation / Ring / Permutation / Maximum disjoint set / Permutation polynomial

From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen

DocID: 1renq - View Document