Algoritmica, Special Issue, Simulated Annealing, A. Sangiovanni-Vincentelli, ed. Vol. 6, No. 3, pp. 295-478, 1991.  Home/Search   Document Not in Database   Summary   Related Articles

....the dynamic programming algorithm for the minimization of the critical path using associativity. This step is followed by simulated annealing which tries to improve the initial solution by applying local moves probabilistically. For simulated annealing we used the most popular set of parameters [36]. For example, we used a geometric cooling schedule with a stopping criteria which Examples and Results 22 of 27 terminates the probabilistic search when no improvement was observed on three consecutive temperatures. After each move, a list of all possible moves is generated for each local ....

Algoritmica, Special Issue, Simulated Annealing, A. Sangiovanni-Vincentelli, ed. Vol. 6, No. 3, pp. 295-478, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC