Zobrazeno 1 - 10
of 603
pro vyhledávání: '"Morales, Fernando A"'
Autor:
Morales, Fernando A
In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (T
Externí odkaz:
http://arxiv.org/abs/2111.05377
Autor:
Morales, Fernando A, Martínez, Jairo A
In this paper we furnish quality certificates for the Divide-and-Conquer method solving the 0-1 Knapsack Problem: the worst case scenario and estimates for the expected performance. The probabilistic setting is given and the main random variables are
Externí odkaz:
http://arxiv.org/abs/2008.04124
In this paper, the mathematical analysis of the Isolation Random Forest Method (IRF Method) for anomaly detection is presented. We show that the IRF space can be endowed with a probability induced by the Isolation Tree algorithm (iTree). In this sett
Externí odkaz:
http://arxiv.org/abs/2004.04512
Autor:
Monroy, Brayan, Sanchez, Karen, Arguello, Paula, Estupiñán, Juan, Bacca, Jorge, Correa, Claudia V., Valencia, Laura, Castillo, Juan C., Mieles, Olinto, Arguello, Henry, Castillo, Sergio, Rojas-Morales, Fernando
Publikováno v:
In Computers in Biology and Medicine October 2023 165
Autor:
Morales, Fernando A.
Publikováno v:
Yugolav Journal of Operations Research, 2020
We present the mathematical modeling for the problem of choosing rooms and proctoring crews for massive tests, together with its implementation as the open-box system RaPID-Omega. The mathematical model is a binary integer programming problem: a comb
Externí odkaz:
http://arxiv.org/abs/1911.06055
Autor:
Morales, Fernando A
Publikováno v:
Revista Integraci\'on, temas de matem\'atica, 2019
The asymptotic analysis of a Darcy-Stokes system modeling the fluid exchange between a narrow channel (Stokes) and a porous medium (Darcy) coupled through a $ C^{2} $ curved interface, is presented. The channel is a cylindrical domain between the int
Externí odkaz:
http://arxiv.org/abs/1902.08642
Autor:
Morales Fernando A.
Publikováno v:
Yugoslav Journal of Operations Research, Vol 33, Iss 3, Pp 341-366 (2023)
In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (T
Externí odkaz:
https://doaj.org/article/f64a1ffc747b48bc888d8fb55f1eebc8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Morales, Fernando A, Martínez, Jairo A
Publikováno v:
Journal of Combinatorial Optimization, 2020
We introduce and asses several Divide \& Conquer heuristic strategies aimed to solve large instances of the 0-1 Minimization Knapsack Problem. The method subdivides a large problem in two smaller ones (or recursive iterations of the same principle),
Externí odkaz:
http://arxiv.org/abs/1901.01215
A big data based method for pass rates optimization in mathematics university lower division courses
In this paper an algorithm designed for large databases is introduced for the enhancement of pass rates in mathematical university lower division courses with several sections. Using integer programming techniques, the algorithm finds the optimal pai
Externí odkaz:
http://arxiv.org/abs/1809.09724