• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Circuit partitioning using mean field annealing

      Thumbnail
      View / Download
      1.5 Mb
      Author(s)
      Bultan, T.
      Aykanat, Cevdet
      Date
      1995
      Source Title
      Neurocomputing
      Print ISSN
      0925-2312
      Electronic ISSN
      1872-8286
      Publisher
      Elsevier
      Volume
      8
      Issue
      2
      Pages
      171 - 194
      Language
      English
      Type
      Article
      Item Usage Stats
      231
      views
      235
      downloads
      Abstract
      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 of the algorithm to some classic optimization problems such as traveling salesperson problem, scheduling problem, knapsack problem and graph partitioning problem. In this paper, MFA is formulated for the circuit partitioning problem using the so called net-cut model. Hence, the deficiencies of using the graph representation for electrical circuits are avoided. An efficient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors is also developed. Comparative performance analysis of the proposed algorithm with two wellknown heuristics, simulated annealing and Kernighan-Lin, indicates that MFA is a successful alternative heuristic for the circuit partitioning problem. © 1995.
      Keywords
      Algorithms
      Combinatorial Mathematics
      Graph Theory
      Heuristic Methods
      Mathematical Models
      Networks (Circuits)
      Optimization
      Performance
      Simulated Annealing
      Asymptotical Factors
      Circuit Partitioning
      Kernighan-Lin
      Mean Field Annealing
      Net-Cut Model
      Neural networks
      Article
      Computer Model
      Cost
      Electric Activity
      Mathematical Analysis
      Mathematical Computing
      Partition Coefficient
      Priority Journal
      Problem Solving
      Theory
      Permalink
      http://hdl.handle.net/11693/25900
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/0925-2312(94)00016-L
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy