𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Universal bases and greedy algorithms for anisotropic function classes

✍ Scribed by V. N. Temlyakov

Publisher
Springer
Year
2002
Tongue
English
Weight
900 KB
Volume
18
Category
Article
ISSN
0176-4276

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simple greedy algorithm for finding fu
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis
✍ Tatsuya Akutsu; Satoru Miyano; Satoru Kuhara πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 186 KB

Inferring functional relations from relational databases is important for the discovery of scientiΓΏc knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation al

Greedy search and a hybrid local optimiz
Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering
✍ Raymond A. Wildman; Daniel S. Weile πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 191 KB

## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i