Buscar
Mostrando ítems 51-60 de 445
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic And Exact Approaches
(Pergamon-Elsevier Science LTDOxford, 2017)
Tardiness minimization in a flexible job shop: A tabu search approach
(Kluwer Academic PublDordrechtHolanda, 2004)
Diseño de un algoritmo de minería de datos basado en grafos para la tarea de aprendizaje de conceptos
(Instituto Nacional de Astrofísica, Óptica y Electrónica, 2012)
Diseño de un algoritmo de minería de datos basado en grafos para la tarea de aprendizaje de conceptos
(Instituto Nacional de Astrofísica, Óptica y Electrónica, 2012)
Desenvolvimento de metaheurísticas para o problema da árvore geradora mínima generalizado
(Universidade Federal de Santa MariaBREngenharia de ProduçãoUFSMPrograma de Pós-Graduação em Engenharia de Produção, 2008-03-20)
The generalized minimum spanning tree problem is present in several situations of the real world, such as in the context of the telecommunications, transports and grouping of data, where a net of necessary clusters to be ...
A comparison about evolutionary algorithms for optimum-path forest clustering optimization
(2013)
In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the ...
Identifying outbreaks in sewer networks: An adaptive sampling scheme under network's uncertainty
(2024)
Motivated by the implementation of a SARS-Cov-2 sewer surveillance system in Chile during the COVID-19 pandemic, we propose a set of mathematical and algorithmic tools that aim to identify the location of an outbreak under ...