Buscar
Mostrando ítems 1-10 de 387
Strong Partially Greedy Bases and Lebesgue-Type Inequalities
(Springer, 2021-12)
In this paper we continue the study of Lebsgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We ...
Quasi-greedy bases for sequences with gaps
(Pergamon-Elsevier Science Ltd, 2021-07)
In this paper, we establish new results in the theory started by T. Oikhberg in Oikhberg (2018) where the author joins greedy approximation theory with the use of sequences with gaps. Concretely, we study and provide some ...
A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements
(Computers, Environment and Urban Systems, 2013)
In this paper we present a Population-Based Iterated Greedy (PBIG) algorithm for delimiting and zoning rural settlements. Each cadastral plots is allocated to a category (traditional–historical, common or none) considering ...
Computer application for the cutting problem of a boardAplicación informática para el problema de corte de un tablero
(Facultad Regional Multidisciplinaria de Estelí. FAREM-Estelí/UNAN-Managua, 2018)
An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times
(Engineering Applications of Artificial Intelligence, 2019)
Degree-greedy algorithms on large random graphs
(Association for Computing Machinery, 2019-01)
Computing the size of maximum independent sets is an NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to compute (or approximate) this independence number for random graphs are notoriously ...