{"created":"2025-01-19T01:37:16.970319+00:00","updated":"2025-01-19T09:33:57.200183+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235673","sets":["6504:11678:11697"]},"path":["11697"],"owner":"44499","recid":"235673","title":["並列最良優先探索におけるBench Transition System探索アルゴリズムの改善"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"986d9f0a-7b8b-4c9d-b113-94a87a890842"},"_deposit":{"id":"235673","pid":{"type":"depid","value":"235673","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"並列最良優先探索におけるBench Transition System探索アルゴリズムの改善","author_link":["644034","644033"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"並列最良優先探索におけるBench Transition System探索アルゴリズムの改善"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2024-03-01","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東大"},{"subitem_text_value":"東大"}]},"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/235673/files/IPSJ-Z86-4A-05.pdf","label":"IPSJ-Z86-4A-05.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-4A-05.pdf","filesize":[{"value":"370.6 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"c90b782f-9240-4e36-9bc5-5ae2e41f6218","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"下田, 卓弥"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"福永, アレックス"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフ探索問題について、最良優先探索アルゴリズム(GBFS)を並列化すると、しばしば逐次GBFSでは展開しないようなノードを展開し、無秩序な挙動をする。そこで探索をGBFSが探索する可能性のある空間、BTS(Bench Transition System)内に制限する手法PUHFが提案された。しかし、PUHFではBTSに含まれることが保証された状態のみを探索するために展開に制約を設け、スレッドが多くの待機時間を費やす。本研究で我々はPUHFの改良を提案し、待機時間を大幅に削減し探索性能を向上させる手法を開発・評価した。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"126","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"125","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":235673,"links":{}}