{"links":{},"id":13590,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013590","sets":["581:742:746"]},"path":["746"],"owner":"1","recid":"13590","title":["詰将棋におけるプロセッサ稼働率を考慮したゲーム木並列探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-09-15"},"_buckets":{"deposit":"0e229ee2-53ea-4cf5-9e7a-5aa52f6f3710"},"_deposit":{"id":"13590","pid":{"type":"depid","value":"13590","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"詰将棋におけるプロセッサ稼働率を考慮したゲーム木並列探索","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"詰将棋におけるプロセッサ稼働率を考慮したゲーム木並列探索"},{"subitem_title":"Improvement of Processor Efficiency in Parallel Search for Tsume - Shogi Game Tree","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"テクニカルノート","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1996-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋工業大学／日本電装クリエイト株式会社"},{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"名古屋工業大学"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nagoya Institute of Technology/Nippondenso Create Co.,Ltd","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/13590/files/IPSJ-JNL3709013.pdf"},"date":[{"dateType":"Available","dateValue":"1998-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3709013.pdf","filesize":[{"value":"328.3 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a88f1cfa-bc1b-4f11-b101-001d8dca0529","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"立松, 靖朗"},{"creatorName":"山田, 雅之"},{"creatorName":"世木, 博久"},{"creatorName":"伊藤, 英則"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuo, Tatematsu","creatorNameLang":"en"},{"creatorName":"Masashi, Yamada","creatorNameLang":"en"},{"creatorName":"Hirohisa, Seki","creatorNameLang":"en"},{"creatorName":"Hidenori, Itoh","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"我々は  詰将棋におけるゲーム木探索が並列に行えることに注目し  並列優先探索により詰将棋を解くプログラムを作成し  詰将棋問題における並列探索の有効性を示した^3). 引き続き  本論文ではこの並列探索において  プロセッサを効率よく使用する方法を検討し  この方法を用いた場合の評価について述べる. その結果  プロセッサ稼働率を考慮しない従来の場合に比べ  解答能力  解答速度ともに向上することが確かめられた.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We have implemented a program for solving Tsume-Shogi problem based on a Parallel Best-First Search method, and have shown the effectiveness of the parallel search in Tsume-Shogi problem in 3). In this paper, we describe a method for improving the processor efficiency of the parallel search. Our program is improved by using this method. Its solvability and performance are evaluated.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1748","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1745","bibliographicIssueDates":{"bibliographicIssueDate":"1996-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"37"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:47:38.194823+00:00","updated":"2025-01-23T01:10:45.703036+00:00"}