Sciweavers

70 search results - page 1 / 14
» Fine-Tuning of Algorithms Using Fractional Experimental Desi...
Sort
View
AE
2009
Springer
13 years 6 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
EC
2010
157views ECommerce» more  EC 2010»
13 years 5 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
EVOW
2010
Springer
13 years 8 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
DCC
1998
IEEE
13 years 9 months ago
A Locally Optimal Design Algorithm for Block-Based Multi-Hypothesis Motion-Compensated Prediction
Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis mo...
Markus Flierl, Thomas Wiegand, Bernd Girod