Buscar
Mostrando ítems 1-10 de 606
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)
A Greedy Randomized Adaptive Search With Probabilistic Learning for solving the Uncapacitated Plant Cycle Location Problem
In this paper, we address the Uncapacitated Plant Cycle Location Problem. It is a location-routing problem aimed at determining a subset of locations to set up plants dedicated to serving customers. We propose a mathematical ...
Greedy clearing of persistent Poissonian dust
(Elsevier Science, 2014-10)
Given a Poisson point process on R, assign either one or two marks to each point of this process, independently of the others. We study the motion of a particle that jumps deterministically from its current location to the ...
Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
(Electronic Notes in Discrete Mathematics, 2018)
A beam-search approach to the set covering problem
(Springer Verlag, 2016)
Selección de atributos por métodos de filtrado y wrapper para predecir la satisfacción de usuarios de salud
(Universidad Nacional Agraria La MolinaPE, 2022)
Las técnicas de minería de datos (TMD) usadas para el aprendizaje supervisado, generalmente deben considerar un gran número de atributos en las bases de datos a ser analizadas, y muchos de estos atributos son irrelevantes ...