Buscar
Mostrando ítems 1-10 de 799
Extension algorithms for reactive routing protocols on Ad-Hoc networks
(IEEE, 2009)
In reactive routing algorithms on Ad-Hoc networks, one of the most important challenges is to minimize the number of route discovery processes, due to their high cost in bandwidth. This is achieved through a careful selection ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
A route selection approach for variable data transmission in wireless sensor networks
The nodes in wireless sensor networks (WSNs) are responsible for communicating data which is primarily of three types viz. video, audio and text. In literature, a large number of energy aware and shortest path based route ...
A Home Health Care multi-objective approach for personnel scheduling and routing problem under an uncertain environment
(Pontificia Universidad Javeriana, 2022)
Peripheral Cemento-Ossifying Fibroma withUncommon Clinical Presentation: A Case Report
(Facultad de Odontología. Universidad de Costa Rica, 2018)
Development of a robust algorithm to compute reactive azeotropes
(Brazilian Soc Chemical EngSao PauloBrasil, 2006)