Name
Abstract | ||
|---|---|---|
We propose two ant---based formulations for solving autocorrelation problems. The formulations are combined with different ACO variants. Preliminary experiments of the derived approaches are conducted on two hard instances of the problem. Their performance is compared to an efficient Tabu Search algorithm, offering useful conclusions and motivation for further investigation. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-32650-9_21 | ANTS |
Keywords | Field | DocType |
hard instance,autocorrelation problem,preliminary experiment,ant-based approach,different aco variant,useful conclusion,efficient tabu search algorithm | Mathematical optimization,Computer science,Artificial intelligence,Tabu search,Machine learning,Autocorrelation | Conference |
Volume | ISSN | Citations |
7461 | 0302-9743 | 2 |
PageRank | References | Authors |
0.37 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ilias S. Kotsireas | 1 | 168 | 29.72 |
| Konstantinos E. Parsopoulos | 2 | 199 | 16.50 |
| Grigoris S. Piperagkas | 3 | 20 | 1.79 |
| M.N. Vrahatis | 4 | 1740 | 151.65 |