{"updated":"2025-01-21T20:30:13.306156+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00078399","sets":["581:6276:6587"]},"path":["6587"],"owner":"11","recid":"78399","title":["分散制約充足問題：特定の制約網に特化した変数順序付けヒューリスティックの提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-11-15"},"_buckets":{"deposit":"096d7af8-a215-49af-ad11-3c6f21ff4491"},"_deposit":{"id":"78399","pid":{"type":"depid","value":"78399","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"分散制約充足問題：特定の制約網に特化した変数順序付けヒューリスティックの提案","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"分散制約充足問題：特定の制約網に特化した変数順序付けヒューリスティックの提案"},{"subitem_title":"Effect of DisCSP Variable-ordering Heuristic for Particular Network Structure","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2011-11-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"},{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"},{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of ISEE, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of ISEE, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of ISEE, Kyushu University","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/78399/files/IPSJ-JNL5211004.pdf"},"date":[{"dateType":"Available","dateValue":"2013-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5211004.pdf","filesize":[{"value":"746.6 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":"f0abc2d0-6e71-49b5-9b1f-600bcb7115b1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"沖本, 天太"},{"creatorName":"岩崎, 敦"},{"creatorName":"横尾, 真"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tenda, Okimoto","creatorNameLang":"en"},{"creatorName":"Atsushi, Iwasaki","creatorNameLang":"en"},{"creatorName":"Makoto, Yokoo","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":"分散制約充足問題とは，制約充足問題における変数および制約が複数のエージェントに分散された問題である．既存の分散制約充足アルゴリズムのほとんどは，任意の制約網で動作することを保証している．しかし，特定の制約網，たとえば，ハブを含むようなスケールフリー的な制約網を対象とする場合，対象とする制約網に特化したアルゴリズム/ヒューリスティックが有効となることが予想される．我々の研究は，特定の制約網に特化したアルゴリズムの開発を目的とする．本論文では，その第1歩として，スケールフリー的な制約網に特化した静的な変数順序付けヒューリスティックを提案し，その有効性を示す．実験では，非同期バックトラッキングを用い，エージェントの優先順位の決定法が，スケールフリー的な制約網ではランダム構造の制約網より，アルゴリズムの性能に大きな影響を与えることを示す．さらに，エージェントの優先順位を提案手法と次数順に基づくヒューリスティックによって決定した，非同期バックトラッキングの性能を比較し，提案手法では最大29%の性能向上が得られることを示した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A Distributed Constraint Satisfaction Problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various algorithms for solving DisCSPs have been developed, which are intended for general purposes, i.e., they can be applied to any network structure. However, if a network has some particular structure, e.g., the network structure is scale-free, we can expect that some specialized algorithms or heuristics, which are tuned for the network structure, can outperform general purpose algorithms/heuristics. In this paper, as an initial step toward developing specialized algorithms for particular network structures, we examine variable-ordering heuristics in scale-free networks. We use the classic asynchronous backtracking algorithm as a baseline algorithm and examine the effect of variable-ordering heuristics. First, we show that the choice of variable-ordering heuristics is more influential in scale-free networks than in random networks. Furthermore, we develop a novel variable-ordering heuristic that is specialized to scale-free networks. Experimental results illustrate that our new variable-ordering heuristic is more effective than a standard degree-based variable-ordering heuristic. Our proposed heuristic reduces the required cycles by 29% at the critical point.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3029","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"3018","bibliographicIssueDates":{"bibliographicIssueDate":"2011-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"52"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:33:45.658631+00:00","id":78399,"links":{}}