English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113311/144292 (79%)
Visitors : 50931334      Online Users : 989
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/73510
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/73510


    Title: Simulated annealing and the mapping problem: A computational study
    Authors: 陳春龍
    Hart, Stephen M.;Chen, Chuen-Lung
    Contributors: 資管系
    Date: 1994-04
    Issue Date: 2015-02-12 14:45:09 (UTC+8)
    Abstract: Given an array of processors, the mapping problem requires assignment of program modules to processors such that the communication time between modules is minimized. Typically, this requires assignment of modules which intercommunicate to adjacent processors. Although polynomial solutions to certain instances of the mapping problem exist, an efficient, exact algorithm for the general-case problem has not been found. Consequently, researchers have concentrated on development of efficient heuristic solutions. This study explores the application of simulated annealing to the mapping problem. Performance of the annealing model will be compared with that of an existing heuristic procedure, and experimentation with various parameters of the annealing algorithm will be employed in determination of the most significant factors affecting the efficiency of the simulated annealing solution.
    Relation: Computers & Operations Research,21(4),455-461
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/0305-0548(94)90032-9
    DOI: 10.1016/0305-0548(94)90032-9
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML2884View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback