Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Julio Laria-Menchaca"'
Autor:
Jesús David Terán-Villanueva, Salvador Ibarra-Martínez, Ph. D., Julio Laria-Menchaca, Ph. D., José Antonio Castán-Rocha, Ph. D., Mayra Guadalupe Treviño-Berrones, M.Sc., Alejandro Humberto García-Ruiz, José Eduardo Martínez-Infante
Publikováno v:
Revista Facultad de Ingeniería, Vol 28, Iss 50, Pp 34-43 (2019)
La planeación de cursos de un centro educativo o universidad está compuesta por múltiples problemas complejos como lo es la asignación de horarios para los alumnos, salones y profesores para cada asignatura. Uno de los problemas iniciales es dete
Externí odkaz:
https://doaj.org/article/c9389478291748b583790b446342f21a
Autor:
Fernando Ornelas, Alejandro Santiago, Salvador Ibarra Martínez, Mirna Patricia Ponce-Flores, Jesús David Terán-Villanueva, Fausto Balderas, José Antonio Castán Rocha, Alejandro H. García, Julio Laria-Menchaca, Mayra Guadalupe Treviño-Berrones
Publikováno v:
Mathematics, Vol 10, Iss 14, p 2513 (2022)
In this work, we investigate the variant of the Internet Shopping Optimization Problem (ISHOP) that considers different item units. This variant is more challenging than the original problem. The original ISHOP is already known as a combinatorial NP-
Externí odkaz:
https://doaj.org/article/da285406b0e1435eaccfb2edddedc498
Autor:
Mariel Abigail Cruz-Nájera, Mayra Guadalupe Treviño-Berrones, Mirna Patricia Ponce-Flores, Jesús David Terán-Villanueva, José Antonio Castán-Rocha, Salvador Ibarra-Martínez, Alejandro Santiago, Julio Laria-Menchaca
Publikováno v:
Symmetry, Vol 14, Iss 6, p 1231 (2022)
This paper tackles the problem of forecasting real-life crime. However, the recollected data only produced thirty-five short-sized crime time series for three urban areas. We present a comparative analysis of four simple and four machine-learning-bas
Externí odkaz:
https://doaj.org/article/cc3417d0cf5e48e78ea9aad7392d795f
Autor:
Edgar Oviedo-Salas, Jesús David Terán-Villanueva, Salvador Ibarra-Martínez, Alejandro Santiago-Pineda, Mirna Patricia Ponce-Flores, Julio Laria-Menchaca, José Antonio Castán-Rocha, Mayra Guadalupe Treviño-Berrones
Publikováno v:
Applied Sciences, Vol 12, Iss 4, p 1965 (2022)
This research addresses the two-dimensional strip packing problem to minimize the total strip height used, avoiding overlapping and placing objects outside the strip limits. This is an NP-hard optimization problem. We propose a greedy randomized adap
Externí odkaz:
https://doaj.org/article/34c6a578b5d844288fb8e328d366a9f7
Autor:
Jesus David Teran Villanueva, Luis Earving Lee, Emilio Castan Rocha, Mayra Guadalupe Treviño Berrones, Salvador Ibarra Martínez, Julio Laria Menchaca, José Antonio Castán Rocha
Publikováno v:
Journal of Computer and Communications. :20-27
University dropout is a growing problem which, in recent years, is using computer techniques to assist in the detection process. The paper presents the evaluation of some prediction algorithms to detect a student with a high possibility of scholar de
Autor:
Fausto Balderas, Salvador Ibarra Martínez, Alejandro Santiago, José Antonio Castán Rocha, Mirna Ponce-Flores, Mayra Guadalupe Treviño Berrones, J. David Terán-Villanueva, Julio Laria Menchaca
Publikováno v:
Energies
Volume 14
Issue 12
Energies, Vol 14, Iss 3473, p 3473 (2021)
Volume 14
Issue 12
Energies, Vol 14, Iss 3473, p 3473 (2021)
The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost. Task schedul
Autor:
Claudia Gómez Santillán, J. David Terán-Villanueva, Julio Laria Menchaca, Laura Cruz-Reyes, Salvador Ibarra Martínez, Héctor J. Fraire-Huacuja, José Antonio Castán Rocha
Publikováno v:
Information Sciences. 478:62-82
The vertex bisection problem splits a graph G = ( V , E ) into two sets, L ⊆ V , | L | = ⌊ | V | / 2 ⌋ and R = V ∖ L , such that it minimizes the number of vertices in L connected to R. This problem is a combinatorial NP-hard problem with rel
Autor:
José Eduardo Martínez-Infante, Jesús David Terán-Villanueva, Alejandro Humberto García-Ruiz, José Antonio Castan-Rocha, Julio Laria-Menchaca, Salvador Ibarra-Martínez, Mayra Guadalupe Treviño-Berrones
Publikováno v:
Revista Facultad de Ingeniería, Volume: 28, Issue: 50, Pages: 34-43, Published: MAR 2019
Revista Facultad de Ingeniería, Vol 28, Iss 50, Pp 34-43 (2019)
Revista Facultad de Ingeniería, Vol 28, Iss 50, Pp 34-43 (2019)
Resumen La planeación de cursos de un centro educativo o universidad está compuesta por múltiples problemas complejos como lo es la asignación de horarios para los alumnos, salones y profesores para cada asignatura. Uno de los problemas iniciales
Autor:
Jesus David Teran Villanueva, Alejandro Humberto Garcia Ruiz, Aurelio Alejandro Santiago Pineda, Mirna Patricia Ponce Flores, José Antonio Castán Rocha, Julio Laria Menchaca, Mayra Guadalupe Treviño Berrones, Salvador Ibarra Martínez
Publikováno v:
Symmetry, Vol 13, Iss 344, p 344 (2021)
Symmetry; Volume 13; Issue 2; Pages: 344
Symmetry; Volume 13; Issue 2; Pages: 344
Electricity is one of the most important resources for the growth and sustainability of the population. This paper assesses the energy consumption and user satisfaction of a simulated air conditioning system controlled with two different optimization
Autor:
Julio Laria Menchaca, Salvador Ibarra Martínez, Mayra Guadalupe Treviño Berrones, José Antonio Castán Rocha, Mirna Ponce-Flores, Alejandro Santiago, J. David Terán-Villanueva
Publikováno v:
Applied Sciences
Volume 10
Issue 21
Applied Sciences, Vol 10, Iss 7500, p 7500 (2020)
Volume 10
Issue 21
Applied Sciences, Vol 10, Iss 7500, p 7500 (2020)
High-Performance Computing systems rely on the software&rsquo
s capability to be highly parallelized in individual computing tasks. However, even with a high parallelization level, poor scheduling can lead to long runtimes
this scheduling i
s capability to be highly parallelized in individual computing tasks. However, even with a high parallelization level, poor scheduling can lead to long runtimes
this scheduling i