Application of multi-core parallel ant colony optimization in target assignment problem
G Dongdong, G Guanghong… - … on Computer Application …, 2010 - ieeexplore.ieee.org
Ant colony optimization (ACO) provides an effective way to solve combinatorial optimization
problem. However, with the complexity of the problem increasing, the ACO algorithm needs …
problem. However, with the complexity of the problem increasing, the ACO algorithm needs …
Lossless and lossy minimal redundancy pyramidal decomposition for scalable image compression technique
M Babel, O Déforges - 2003 IEEE International Conference on …, 2003 - ieeexplore.ieee.org
We present a new scalable compression technique dealing simultaneously with both lossy
and lossless image coding. An original DPCM scheme with refined context is introduced …
and lossless image coding. An original DPCM scheme with refined context is introduced …
Realization of parallel ant colony algorithm based on TBB multi-core platform
N Li, D Gao, G Gong, Z Chen - 2010 International Forum on …, 2010 - ieeexplore.ieee.org
TBB (Thread Building Blocking) is currently a representative parallel computing platform of
multi-core processors. The ant colony algorithm is used to solve combinatorial optimization …
multi-core processors. The ant colony algorithm is used to solve combinatorial optimization …
[PDF][PDF] Parallel EigenAnt algorithm based on MPI by ACO approach
N Damghani, VS Naeini - 2017 - pdfs.semanticscholar.org
Parallelization is among the best approaches that can be used to enhance the performance
in heuristic algorithms. The EigenAnt algorithm model is an Ant Colony Optimization (ACO) …
in heuristic algorithms. The EigenAnt algorithm model is an Ant Colony Optimization (ACO) …