{"updated":"2025-01-22T19:58:53.357337+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00024266","sets":["1164:1579:1673:1674"]},"path":["1674"],"owner":"1","recid":"24266","title":["Hill - Climbingを用いたパーティションニング最適化手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-12-16"},"_buckets":{"deposit":"1273586e-f87b-43a3-9e77-9e04aa84347c"},"_deposit":{"id":"24266","pid":{"type":"depid","value":"24266","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Hill - Climbingを用いたパーティションニング最適化手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hill - Climbingを用いたパーティションニング最適化手法"},{"subitem_title":"An Efficient Hill - Climbing Algorithm For Partitioning","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1993-12-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"（株）富士通研究所"},{"subitem_text_value":"（株）富士通研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"FUJITSU LABORATORIES LTD.","subitem_text_language":"en"},{"subitem_text_value":"FUJITSU LABORATORIES LTD.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/24266/files/IPSJ-ARC93103001.pdf"},"date":[{"dateType":"Available","dateValue":"1995-12-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC93103001.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"36cd79c2-2f59-46c6-9f67-78c9332682bb","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1993 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"澁谷, 利行"},{"creatorName":"河村, 薫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Toshiyuki, Shibuya","creatorNameLang":"en"},{"creatorName":"Kaoru, Kawamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では，パーティショニングにおけるmin?cutの最適化手法としてStable?Net?Transition法(）について述べる．min?cutを実行したとき，カットされたままの状態のネットをstableネットと定義する．SNTでは，このstableネットに着目してhill?climbingを行なうことにより，実用的な時間内でカットサイズの最適化を行なうことを特徴としている．SOGゲートアレイの実レイアウトデータを用いて実験を行ない，カットサイズ，収束性，配線長，配線率を評価し，その有効性を示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we present a stable-net-transition method (SNT) for min-cut partitioning. SNT is a hill-climbing method for optimizing the cut set size of a network in practical amount of time. Good experimental results have been observed for cut set size, wire length and routing ratio.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告計算機アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1993-12-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"111(1993-ARC-103)","bibliographicVolumeNumber":"1993"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:55:26.891608+00:00","id":24266,"links":{}}