{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00213248","sets":["1164:2036:10484:10724"]},"path":["10724"],"owner":"44499","recid":"213248","title":["モンテカルロ木探索と整数線形計画法の組み合わせによる最適スケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-10-08"},"_buckets":{"deposit":"20e6a4dd-3005-462c-84a5-0040455c2204"},"_deposit":{"id":"213248","pid":{"type":"depid","value":"213248","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"モンテカルロ木探索と整数線形計画法の組み合わせによる最適スケジューリング","author_link":["545342","545343"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"モンテカルロ木探索と整数線形計画法の組み合わせによる最適スケジューリング"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ポスターセッション","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2021-10-08","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":"Tokyo City University","subitem_text_language":"en"},{"subitem_text_value":"Tokyo City University","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/213248/files/IPSJ-SLDM21195001.pdf","label":"IPSJ-SLDM21195001.pdf"},"date":[{"dateType":"Available","dateValue":"2023-10-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM21195001.pdf","filesize":[{"value":"500.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"671def28-e7b2-4693-81cf-3524d4ad02ab","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松岡, 尚典"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"瀬戸, 謙修"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"高位合成は，LSI の大規模化と複雑化に対処する設計技術として注目されている．その 1 工程であるスケジューリングは，生成される RTL 回路の面積や性能に大きな影響を与える．従来手法では，大規模な DFG に対する最適性低下や処理時間増大が問題になっていた．そこで，効果的な発見的手法であるモンテカルロ木探索に整数線形計画法を組み合わせることで，最適性と処理時間のバランスの取れたスケジューリングアルゴリズムを検討する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-10-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021-SLDM-195"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":213248,"updated":"2025-01-19T17:13:32.242560+00:00","links":{},"created":"2025-01-19T01:14:08.094820+00:00"}