Hardware/software partitioning based on greedy algorithm and simulated annealing algorithm

2013 ◽  
Vol 33 (7) ◽  
pp. 1898-1902 ◽  
Author(s):  
Liang ZHANG ◽  
Cheng XU ◽  
Zheng TIAN ◽  
Tao LI
2013 ◽  
Vol 4 (2) ◽  
pp. 20-28
Author(s):  
Farhad Soleimanian Gharehchopogh ◽  
Hadi Najafi ◽  
Kourosh Farahkhah

The present paper is an attempt to get total minimum of trigonometric Functions by Simulated Annealing. To do so the researchers ran Simulated Annealing. Sample trigonometric functions and showed the results through Matlab software. According the Simulated Annealing Solves the problem of getting stuck in a local Maxterm and one can always get the best result through the Algorithm.


Sign in / Sign up

Export Citation Format

Share Document