Name
Abstract | ||
|---|---|---|
Throughout the last years, optimization problems on a large number of variables, sometimes over 1000, are becoming common. Thus, algorithms that can tackle them effectively, both in result quality and run time, are necessary. Among these specific algorithms for high-dimensional problems, memetic algorithms, which are the result of the hybridization of an evolutionary algorithm and a local improvement technique, have arisen as very powerful optimization systems for this type of problems. A very effective algorithm of this kind is the MA-SW-Chains algorithm. On the other hand, general purpose computing using Graphics Processing Units (GPUs) has become a very active field because of the high speed-up ratios that can be obtained when applied to problems that exhibit a high degree of data parallelism. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ins.2014.09.018 | Information Sciences |
Keywords | Field | DocType |
Memetic algorithm,Optimization problem,GPU,CUDA | Memetic algorithm,Evolutionary algorithm,CUDA,Computer science,Artificial intelligence,Optimization problem,Graphics,Central processing unit,Parallel computing,Algorithm,Curse of dimensionality,Data parallelism,Machine learning | Journal |
Volume | ISSN | Citations |
293 | 0020-0255 | 10 |
PageRank | References | Authors |
0.45 | 42 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miguel Lastra | 1 | 82 | 6.86 |
| Daniel Molina | 2 | 358 | 12.28 |
| José Manuel Benítez | 3 | 888 | 56.02 |