Keywords
Greedy algorithmGreedy randomized adaptive search procedureAlgorithmMathematicsApproximation algorithmFunction (biology)Computational Science and EngineeringMathematical optimizationComputer scienceApplied mathematics
Affiliated Institutions
Related Publications
Handbook of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...
A Fast Learning Algorithm for Deep Belief Nets
We show how to use “complementary priors” to eliminate the explaining-away effects that make inference difficult in densely connected belief nets that have many hidden layers. U...
Mathematical Methods of Statistics.
Journal Article Mathematical Methods of Statistics Get access Mathematical Methods of Statistics. By HAROLD CRAMER. Princeton University Press (London : Geoffrey Cumberlege), 19...
Generalization of Back propagation to Recurrent and Higher Order Neural Networks
A general method for deriving backpropagation algorithms for networks with recurrent and higher order networks is introduced. The propagation of activation in these networks is ...
A new optimizer using particle swarm theory
The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently develope...
Publication Info
- Year
- 1996
- Type
- article
- Volume
- 5
- Issue
- 1
- Pages
- 173-187
- Citations
- 559
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
559
OpenAlex
Cite This
Ronald DeVore,
Vladimir Temlyakov
(1996).
Some remarks on greedy algorithms.
Advances in Computational Mathematics
, 5
(1)
, 173-187.
https://doi.org/10.1007/bf02124742
Identifiers
- DOI
- 10.1007/bf02124742