✦ LIBER ✦

Lattice rule algorithms for multivariate approximation in the average case setting

✍ Scribed by Frances Y. Kuo; Ian H. Sloan; Henryk Woźniakowski

Book ID: 108163788
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 422 KB
Volume: 24
Category: Article
ISSN: 0885-064X
DOI: 10.1016/j.jco.2006.10.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattice Algorithms for MultivariateL∞App

Lattice Algorithms for MultivariateL∞Approximation in the Worst-Case Setting

✍ Frances Y. Kuo; Grzegorz W. Wasilkowski; Henryk Woźniakowski 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 503 KB

Polynomial-Time Algorithms for Multivari

Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting

✍ G. W. Wasilkowski; H. Woźniakowski 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 644 KB

Average-case approximation ratio of the

Average-case approximation ratio of the 2-opt algorithm for the TSP

✍ Christian Engels; Bodo Manthey 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 474 KB

An algorithm for constructing a minimal

An algorithm for constructing a minimal partial realization in the multivariable case

✍ Margreet Kuijper 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 631 KB

It is known that the Berlekamp-Massey algorithm from information theory can be used to compute scalar minimal partial realizations. Recently, it has been interpreted in terms of exact modeling of behaviors. In this paper, we extend these results to the multivariable case. We put the behavioral theor

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

The construction of ε-approximate algori

The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets

✍ M.Ya. Kovalev; Ya.M. Shafranskii 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 836 KB