Buscar
Mostrando ítems 151-160 de 1974
Evaluación y optimización de arquitecturas distribuidas tipo Fog Computing para Internet of Things
(Universidad Nacional de Ingeniería, 2020)
Evaluación y optimización de arquitecturas distribuidas tipo Fog Computing para Internet of Things
(Universidad Nacional de Ingeniería, 2020)
Aportes de la arquitectura Dew Computing al internet de las cosas: comparaciones entre implementaciones piloto de ambas arquitecturas
(Universidad Autónoma de Bucaramanga UNABFacultad IngenieríaMaestría en Telemática, 2018)
Dew computing ó la computación de rocío o lágrima ha despertado gran interés en la academia, debido a la separación de los procesos de computación distribuida; donde se encuentran las capas de cloud Computing (computación ...
Approximation algorithms for connected graph factors of minimum weight
(Springer, 2018)
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of ...
Approximately coloring graphs without long induced paths
(Springer, 2017)
It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ...
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows
(John Wiley & Sons Inc, 2020-07)
In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing problem with time windows in which the goal is to minimize the total route duration. The travel time between two customers ...