A bi-objective heuristic for heterogeneous MPSoC design space exploration.
Braham Lotfi MediouniSmaïl NiarRachid BenmansourKarima BenatchbaMouloud KoudilPublished in: IDT (2015)
Keyphrases
- bi objective
- design space exploration
- set covering problem
- efficient solutions
- multi objective
- design space
- optimal solution
- network design
- ant colony optimization
- heuristic methods
- design process
- computer architecture
- multi objective optimization
- shortest path problem
- multiple objectives
- nsga ii
- simulated annealing
- solution quality
- knapsack problem
- real world
- optimization algorithm
- search algorithm
- genetic programming
- genetic algorithm
- information systems
- artificial intelligence
- dynamic programming
- shortest path
- computer systems
- data processing