{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00123348","sets":["6504:8032:8036"]},"path":["8036"],"owner":"1","recid":"123348","title":["併合法による制約充足の並列化効果について"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-03-01"},"_buckets":{"deposit":"578e834d-5492-46ff-bcd0-dbe1332d370f"},"_deposit":{"id":"123348","pid":{"type":"depid","value":"123348","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"併合法による制約充足の並列化効果について","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"併合法による制約充足の並列化効果について"},{"subitem_title":"On Parallelism of Merge Method for Constraint Satisfaction","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1993-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":"筑波大学 電子・情報工学系"},{"subitem_text_value":"筑波大学 電子・情報工学系"},{"subitem_text_value":"筑波大学 電子・情報工学系"},{"subitem_text_value":"筑波大学 電子・情報工学系"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Inst.Inf.Sci.& Electr.,University of TSUKUBA","subitem_text_language":"en"},{"subitem_text_value":"Inst.Inf.Sci.& Electr.,University of TSUKUBA","subitem_text_language":"en"},{"subitem_text_value":"Inst.Inf.Sci.& Electr.,University of TSUKUBA","subitem_text_language":"en"},{"subitem_text_value":"Inst.Inf.Sci.& Electr.,University of TSUKUBA","subitem_text_language":"en"},{"subitem_text_value":"Inst.Inf.Sci.& Electr.,University of TSUKUBA","subitem_text_language":"en"}]},"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/123348/files/KJ00001337180.pdf"},"date":[{"dateType":"Available","dateValue":"1993-03-01"}],"format":"application/pdf","filename":"KJ00001337180.pdf","filesize":[{"value":"202.8 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"81f53818-a682-4e50-bf70-6c5cf33514cf","displaytype":"detail","licensetype":"license_note"}]},"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":"制約充足問題(以下CSPと略記)が解を有するかどうかを決定する問題は、NP完全問題のクラスに属しており、その意味で効率のよい汎用アルゴリズムは存在しないと予想される。したがって、具体的な応用問題ごとに、その特徴を生かした解法を開発する心要がある。組合せ探索問題においては、並列処理の研究が盛んに行われている。分割統治を応用した並列化はその例である。CSPの解法の1つとして、制約間の関係を表す制約グラフ上で、制約の整合化を繰り返す方法、すなわち併合法があるが、併合法も割統治を応用して並列処理できる。しかし、分割統治による並列化は、CSPにおいて心ずしも有効とは限らないことが実験によって明らかにされている。本稿では、CSPの解法の1つである併合法を、分割統治を応用として並列化する効果について考察する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1993-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"人工知能及び認知科学","bibliographicVolumeNumber":"第46回"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":123348,"updated":"2025-01-21T02:59:35.570805+00:00","links":{},"created":"2025-01-19T00:03:26.344623+00:00"}