| R. Cimikowski and P. Shope, "A Neural Network Algorithm for a Graph Layout Problem," IEEE Transactions on Neural Networks, 7(2):341-345, 1996. |
....al. 1992) mapping problem (Bultan Aykanat, 1992) knapsack problem (Ohlsson et al. 1993; Ohlsson Pi, 1997) communication routing problem (Hakkinen et al. 1998) graph partitioning problem (Herault Niez, 1989; Peterson Sodeberg, 1989; Van den Bout Miller, 1990) graph layout problem (Cimikowski Shope, 1996), circuit partitioning problem (Yih Mazumder, 1990; Bultan Aykanat, 1995) In this paper, we apply the Mean Field Annealing (MFA) technique to the cell placement problem. MFA is a new approach for solving combinatorial optimization problems (Peterson Sodeberg 1989; Van den Bout Miller ....
Cimikowski, R., & Shope, P. (1996). A neural-network algorithm for a graph layout problem. IEEE Transactions on Neural Networks, 7(2), 341--345.
....al. 1992) mapping problem (Bultan Aykanat, 1992) knapsack problem (Ohlsson et al. 1993; Ohlsson Pi, 1997) communication routing problem (Hakkinen et al. 1997) graph partitioning problem (Herault Niez, 1989; Peterson Sodeberg, 1989; Van den Bout Miller, 1990) graph layout problem (Cimikowski Shope, 1996), circuit partitioning problem (Yih Mazumder, 1990; Bultan Aykanat, 1995) In this paper, we apply the Mean Field Annealing (MFA) technique to the cell placement problem. MFA is a new approach for solving combinatorial optimization problems (Peterson Sodeberg 1989; Van den Bout Miller ....
Cimikowski, R., & Shope, P. (1996). A neural-network algorithm for a graph layout problem. IEEE Transactions on Neural Networks, 7(2), 341--345.
No context found.
R. Cimikowski and P. Shope, "A Neural Network Algorithm for a Graph Layout Problem," IEEE Transactions on Neural Networks, 7(2):341-345, 1996.
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