๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sparse Dynamic Programming for Evolutionary-Tree Comparison

โœ Scribed by Farach, Martin; Thorup, Mikkel

Book ID
118178136
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
426 KB
Volume
26
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[Genetic and Evolutionary Computation] L
[Genetic and Evolutionary Computation] Linear Genetic Programming || A Comparison with Tree-Based Genetic Programming
โœ , ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer US ๐ŸŒ English โš– 233 KB

linear Genetic Programming Examines The Evolution Of Imperative Computer Programs Written As Linear Sequences Of Instructions. In Contrast To Functional Expressions Or Syntax Trees Used In Traditional Genetic Programming (gp), Linear Genetic Programming (lgp) Employs A Linear Program Structure As Ge

Sparse Dynamic Programming for Longest C
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
โœ Brenda S. Baker; Raffaele Giancarlo ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as computer science, computational biology, and speech recognition. We provide a new sparse dynamic programming technique that extends the Hunt-

Dynamic Programming for Minimum Steiner
Dynamic Programming for Minimum Steiner Trees
โœ B. Fuchs; W. Kern; D. Molle; S. Richter; P. Rossmanith; X. Wang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer ๐ŸŒ English โš– 180 KB