Now showing items 1-3 of 3

    • Circuit partitioning using mean field annealing 

      Bultan, T.; Aykanat, C. (Elsevier, 1995)
      Mean field annealing (MFA) algorithm, proposed for solving combinatorial optimization problems, combines the characteristics of neural networks and simulated annealing. Previous works on MFA resulted with successful mapping ...
    • A fast neural-network algorithm for VLSI cell placement 

      Aykanat, C.; Bultan, T.; Haritaoğlu, İ. (Pergamon Press, 1998)
      Cell placement is an important phase of current VLSI circuit design styles such as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) ...
    • Parallel mapping and circuit partitioning heuristics based on mean field annealing 

      Bultan, Tevfik (Bilkent University, 1992)
      Moan Field Annealinp; (MFA) aJgoritlim, receñí,ly proposc'd for solving com binatorial optimization problems, combines the characteristics of nenral networks and simulated annealing. In this thesis, MFA is formulated for ...