Now showing items 1-6 of 6

    • Assembly line balancing using genetic algorithms 

      Tanyer, Muzaffer (Bilkent University, 1997)
      For the last few decades, the genetic algorithms (GAs) have been used as a kind of heuristic in many areas of manufacturing. Facility layout, scheduling, process planning, and assembly line balancing are some of the areas ...
    • 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 ...
    • A simulation optimization for breast cancer screening in Turkey 

      Keyf, Dilek (Bilkent University, 2014)
      Breast cancer is the most common cancer type among women in the world. 6.3 million women were diagnosed with breast cancer between 2007 - 2012 and 25% of cancers in women are breast cancer. Early diagnosis and early ...
    • Two novel multiway circuit partitioning algorithms using relaxed locking 

      Dasdan, A.; Aykanat, C. (IEEE, 1997)
      All the previous Kernighan-Lin-based (KL-based) circuit partitioning algorithms employ the locking mechanism, which enforces each cell to move exactly once per pass. In this paper, we propose two novel approaches for ...