Login / Signup
An efficient ACO-based algorithm for scheduling tasks onto dynamically reconfigurable hardware using TSP-likened construction graph.
Morteza Mollajafari
Hadi Shahriar Shahhoseini
Published in:
Appl. Intell. (2016)
Keyphrases
</>
np hard
ant colony optimization
simulated annealing
hardware implementation
search space
spanning tree
scheduling problem
particle swarm optimization
traveling salesman problem
weighted graph
highly efficient
parallel processors