Results 151 to 160 of about 179,741 (181)
Some of the next articles are maybe not open access.
2001
In a separable Hilbert space $\cal H$, greedy algorithms iteratively define $m$-term approximants to a given vector $f$ from a complete redundant dictionary $\cal D$. With very large dictionaries, the pure greedy algorithm cannot be implemented and must be replaced with a weak greedy algorithm which is defined through a weakness sequence $t_m \in [0,1],
openaire +1 more source
In a separable Hilbert space $\cal H$, greedy algorithms iteratively define $m$-term approximants to a given vector $f$ from a complete redundant dictionary $\cal D$. With very large dictionaries, the pure greedy algorithm cannot be implemented and must be replaced with a weak greedy algorithm which is defined through a weakness sequence $t_m \in [0,1],
openaire +1 more source
Wind turbine layout optimization with multiple hub height wind turbines using greedy algorithm
Renewable Energy, 2016Kai Chen
exaly
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
International Journal of Production Research, 2013Shih-Wei Lin +2 more
exaly
Carousel greedy: A generalized greedy algorithm with applications in optimization
Computers and Operations Research, 2017Carmine Cerrone +2 more
exaly