The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
Santosh Tiwari, Georges Fadel, Patrick Koch, Kalya...
Researchers have proposed using hardware data compression units within the memory hierarchies of microprocessors in order to improve performance, energy efficiency, and functional...
Xi Chen, Lei Yang, Haris Lekatsas, Robert P. Dick,...
Abstract— This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu