Resultados de búsqueda - "algorithm"

An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system por Mendoza Gómez, Rodolfo, Ríos Mercado, Roger Z., Valenzuela Ocaña, Karla B.

Enlace del recurso

Automatic Frequency Identification under Sample Loss in Sinusoidal Pulse Width Modulation Signals Using an Iterative Autocorrelation Algorithm por Said, Alejandro, Davizón, Yasser, Espino Román, Piero, Rodríguez Said, Roberto, Hernández Santos, Carlos

“…In this work, we present a simple algorithm to calculate automatically the Fourier spectrum of a Sinusoidal Pulse Width Modulation Signal (SPWM). …”
Enlace del recurso

New Algorithm Based on Sign Decomposition to Verify the Robust Stability Property for a Class of Linear Time-Delay Systems por Díaz Rodríguez, Iván D., Romero, Gerardo, Elizondo, Cesar

“…Also, it is shown that it is possible to verify the robust stability property by first obtaining the Hurwitz matrix from the characteristic equation for this class of systems and then checking the leading principal minors positivity using the sign definite decomposition. Finally, an algorithm codified in MATLAB is used to evaluate and graphically show the robust stability property. …”
Enlace del recurso

Treré, E. (2020). Activismo mediático híbrido. Ecologías, imaginarios, algoritmos. FES Comunicación por Flores-Márquez, Dorismilda

Materias: “…algorithms…”
Enlace del recurso

Análisis comparativo de una metaheurística en base a algoritmo genético vs un método de ramificación y corte para un caso de entrega y recolección con restricciones de ventana de h... por López Pérez, Jesús Fabián

Materias: “…Genetic Algorithms…”
Enlace del recurso

Análisis comparativo de una metaheurística en base a algoritmo genético vs un método de ramificación y corte para un caso de entrega y recolección con restricciones de ventana de horario (Comparative analysis of a metaheuristic based on a genetic algorithm versus a branch & cut method for a pickup and delivery problem with time windows constraints) por López, Fabián

“…An experimental design is developed with good results that makes use of optimum solutions obtained by means of branch and cut algorithm without time limit.…”
Enlace del recurso

Un método de programación mixta entera para un problema de transportación de movimiento continuo con restricciones de servicio por López, J. Fabián

Materias: “…Genetic Algorithms…”
Enlace del recurso

Algoritmo de encriptado empleando sistemas caóticos de orden no entero en imágenes médicas por Posadas-Castillo, Cornelio, Zambrano-Serrano, Ernesto, Platas-Garza, Miguel Angel, García-Ramírez, Pedro Javier, Rodríguez-Cruz, José Ramón

“…Encryption algorithm using non-integer order chaotic systems in medical images…”
Enlace del recurso

Las tecnologías de la información aplicadas al derecho: entre el código abierto, el algoritmo y el libre albedrío [Digresión sobre las aplicaciones de los modelos de gestión de ar... por Heredia López , Alejandro, Badii Z., Mohammad H.

“…The Information technologies applied to law: between open source, algorithm and free will [Digression on the applications of file management models in the Virtual Court of the Judicial Branch of the State of Nuevo León (PJENL)] …”
Enlace del recurso

Analyzing the Performance of a Hybrid Heuristic for Solving a Bilevel Location Problem under Different Approaches to Tackle the Lower Level por Maldonado Pinto, Carmen Sayuri, Casas Ramírez, Martha Selene, Camacho Vallejo, José Fernando

“…The proposed algorithm outperforms the evolutionary algorithm already existing in the literature. …”
Enlace del recurso

Solving a green logistics bi-level bi-objective problem. por Maldonado Pinto, Carmen Sayuri

“…Hence, a tabu search algorithm for solving the aforementioned case is proposed. …”
Enlace del recurso

Solving a green logistics bi-level bi-objective problem. por Maldonado Pinto, Carmen Sayuri

“…Hence, a tabu search algorithm for solving the aforementioned case is proposed. …”
Enlace del recurso

Decision policy scenarios for just-in-sequence (JIS) deliveries por Cedillo Campos, Miguel Gastón, Morones Ruelas, Darío, Lizarraga Lizarraga, Giovanni, González Feliu, Jesús, Garza Reyes, José Arturo

“…Consequently, the proposed algorithm considers a periodic review of the inventory that assumes a steady demand and short response times is developed and applied.…”
Enlace del recurso

Fitting phase type distribution to service process with sequential phases por Nanda, Ankita

“…Furthermore it checks how accurately the proposed algorithm approximates a given distribution.…”
Enlace del recurso

Fitting phase type distribution to service process with sequential phases por Nanda, Ankita

“…Furthermore it checks how accurately the proposed algorithm approximates a given distribution.…”
Enlace del recurso

Identification of Quasi-Stationary Dynamic Objects with the Use of Derivative Disproportion Functions por Kalashnikov, Vyacheslav V., Avramenko, Viktor V., Slipushko, Nikolay Yu., Kalashnykova, Nataliya I., Konoplyanchenko, Anton E.

“…This paper presents an algorithm for designing a cryptographic system, in which the derivative disproportion functions (key functions) are used. …”
Enlace del recurso

Identification of Quasi-Stationary Dynamic Objects with the Use of Derivative Disproportion Functions por Kalashnikov, Vyacheslav V., Avramenko, Viktor V., Slipushko, Nikolay Yu., Kalashnykova, Nataliya I., Konoplyanchenko, Anton E.

“…Abstract This paper presents an algorithm for designing a cryptographic system, in which the derivative disproportion functions (key functions) are used. …”
Enlace del recurso

Alternative Method to Estimate the Fourier Expansions and Its Rate of Change por Rodríguez Maldonado, Johnny, Posadas Castillo, Cornelio, Zambrano Serrano, Ernesto

“…Additionally, the proposed Taylor–Kalman–Fourier algorithm (TKFA) achieves a null-flat frequency response around the frequency operation. …”
Enlace del recurso

A branch and cut approach to the orienteering problem with mandatory visits and conflicts por Pérez Franco, Marlene

“…The goal is to find the route that maximizes the collected score, including all the mandatory and some optional vertices, without generating conflict between vertices or exceeding the time limit. The B&C algorithm is expected to outperform the performance of the best-known methods existing in the OPMVC literature in terms of computational efficiency and solution quality. …”
Enlace del recurso

A branch and cut approach to the orienteering problem with mandatory visits and conflicts por Pérez Franco, Marlene

“…The goal is to find the route that maximizes the collected score, including all the mandatory and some optional vertices, without generating conflict between vertices or exceeding the time limit. The B&C algorithm is expected to outperform the performance of the best-known methods existing in the OPMVC literature in terms of computational efficiency and solution quality. …”
Enlace del recurso