Results 261 to 270 of about 43,512 (302)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Greedy by Chance - Stochastic Greedy Algorithms
2010 Sixth International Conference on Autonomic and Autonomous Systems, 2010For many complex combinatorial optimization problems, obtaining good solutions quickly is of value either by itself or as part of an exact algorithm. Greedy algorithms to obtain such solutions are known for many problems. In this paper we present stochastic greedy algorithms which are perturbed versions of standard greedy algorithms, and report on ...
Viswanathan Kodaganallur, Anup K. Sen
openaire +1 more source
Mathematical Notes, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Carousel greedy: A generalized greedy algorithm with applications in optimization [PDF]
Computers and Operations Research, 2017 In this paper, we introduce carousel greedy, an enhanced greedy algorithm which seeks to overcome the traditional weaknesses of greedy approaches. We have applied carousel greedy to a variety of well-known problems in combinatorial optimization such as ...
Carmine Cerrone +2 more
exaly +2 more sources
When the greedy algorithm fails [PDF]
Discrete Optimization, 2004 We provide a characterization of the cases when the greedy algorithm may produce the unique worst possible solution for the problem of finding a minimum weight base in an independence system when the weights are taken from a finite range.
Jørgen Bang-Jensen +2 more
exaly +2 more sources
The Thresholding Greedy Algorithm, Greedy Bases, and Duality
Constructive Approximation, 2003Let \(X\) be a Banach space with a normalized basis \((e_n)\) and biorthogonal functionals \((e_n^*)\) and let \(x\in X\). Order the nonzero scalars \(e_n^*(x)\) by decreasing the modulus (if \(| e_n^*(x)| =| e_m^*(x)| \) and ...
Dilworth, S. J. +3 more
openaire +2 more sources
A Greedy Algorithm for Aligning DNA Sequences
Journal of Computational Biology, 2000 For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be ...
Scott Schwartz +2 more
exaly +1 more source
Matroids and the greedy algorithm
Mathematical Programming, 1971Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and extended to certain more general optimization problems which are linear programs relative to certain derived polyhedra.
openaire +1 more source
Adv. Comput. Math., 2000
Theoretical aspects of the efficiency of \(M\)-term approximation is studied for ``weak'' greedy algorithms. These are defined by weaker assumptions than their known analogs: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm. Convergence theorems and rates of approximation by these algorithms are proved.
openaire +1 more source
Theoretical aspects of the efficiency of \(M\)-term approximation is studied for ``weak'' greedy algorithms. These are defined by weaker assumptions than their known analogs: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm. Convergence theorems and rates of approximation by these algorithms are proved.
openaire +1 more source
1995
We consider the selection of two basketball teams at a neighborhood playground to illustrate the greedy method. Usually the top two players are designated captains. All other players line up while the captains alternate choosing one player at a time. Usually, the players are picked using a greedy strategy.
Raymond Greenlaw +2 more
openaire +1 more source
We consider the selection of two basketball teams at a neighborhood playground to illustrate the greedy method. Usually the top two players are designated captains. All other players line up while the captains alternate choosing one player at a time. Usually, the players are picked using a greedy strategy.
Raymond Greenlaw +2 more
openaire +1 more source