{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00125372","sets":["6504:8055:8060"]},"path":["8060"],"owner":"1","recid":"125372","title":["制約充足問題の併合解法における並列化の効率解析"],"pubdate":{"attribute_name":"公開日","attribute_value":"1994-03-07"},"_buckets":{"deposit":"10ac7d1d-d703-4d80-a0d7-a8fe265f3ff6"},"_deposit":{"id":"125372","pid":{"type":"depid","value":"125372","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":"Parallel Processing Performance of Merge Method for Constraint Satisfaction Problems","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1994-03-07","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":"筑波大学電子・情報工学系"}]},"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"}]},"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/125372/files/KJ00001332156.pdf"},"date":[{"dateType":"Available","dateValue":"1994-03-07"}],"format":"application/pdf","filename":"KJ00001332156.pdf","filesize":[{"value":"154.3 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"03732bc6-e55a-4f59-80d7-25bb8394c0f0","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":"制約充足問題(Constraint Satisfaction Problem, 以下CSPと略言記)を解くアプローチの1つに併合法がある。併合法は分割統治法の考え方を応用して容易に処理を並列化できる。しかし、この並列化はCSPにおいては必ずしも有効ではないことが実験によって明らかにされている。本稿では制約数4のCSPを例に、並列処理の効率が逐次処理より悪くなる必要十分条件を求め、この条件から併合法の並列処理の効率を決める要因について考察する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"9","bibliographicIssueDates":{"bibliographicIssueDate":"1994-03-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"人工知能及び認知科学","bibliographicVolumeNumber":"第48回"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":125372,"updated":"2025-01-21T02:10:23.471350+00:00","links":{},"created":"2025-01-19T00:05:10.442233+00:00"}