✦ LIBER ✦

An Algorithm to Compute Bounds for the Star Discrepancy

✍ Scribed by Eric Thiémard

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 596 KB
Volume: 17
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.2001.0600

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing Bounds for the Star Discrepanc

Computing Bounds for the Star Discrepancy

✍ E. Thiémard 📂 Article 📅 2000 🏛 Springer Vienna 🌐 English ⚖ 200 KB

An algorithm for generating low discrepa

An algorithm for generating low discrepancy sequences on vector computers

✍ Christian Lécot 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 210 KB

An algorithm to compute maximal contract

An algorithm to compute maximal contractions for Horn clauses

✍ Jie Luo; Wei Li 📂 Article 📅 2011 🏛 Science in China Press (SCP) 🌐 English ⚖ 261 KB

An algorithm for maximizing entropy subj

An algorithm for maximizing entropy subject to simple bounds

✍ M. J. D. Powell 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 538 KB

Lagrangian relaxation for the star-star

Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds

✍ Andranik Mirzaian 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 673 KB

The star-star concentrator location problem (SSCLP), which is a network layout problem, is considered. SSCLP is formulated as an integer linear programming problem. The Lagrangian relaxation (LR) method is used to obtain suboptimal solutions (upper bounds) and lower bounds. Three different LRs are u

An algorithm for computing the distance

An algorithm for computing the distance to uncontrollability

✍ L. Elsner; C. He 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 555 KB