{"created":"2023-05-15T12:16:51.513963+00:00","id":341,"links":{},"metadata":{"_buckets":{"deposit":"392d39dd-2c65-4124-b8e1-c2ce3856359f"},"_deposit":{"created_by":3,"id":"341","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"341"},"status":"published"},"_oai":{"id":"oai:tuis.repo.nii.ac.jp:00000341","sets":["1:4:38:104"]},"author_link":["1375","1376","1377"],"control_number":"341","item_1701328008552":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"東京情報大学","subitem_publisher_language":"ja"}]},"item_1_biblio_info_14":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2006-02-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"12","bibliographicPageStart":"1","bibliographicVolumeNumber":"9","bibliographic_titles":[{"bibliographic_title":"東京情報大学研究論集","bibliographic_titleLang":"ja"}]}]},"item_1_creator_6":{"attribute_name":"著者名(日)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"永井, 保夫","creatorNameLang":"ja"},{"creatorName":"ナガイ, ヤスオ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"1375","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Nagai, Yasuo","creatorNameLang":"en"}]}]},"item_1_creator_7":{"attribute_name":"著者名よみ","attribute_type":"creator","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"1376","nameIdentifierScheme":"WEKO"}]}]},"item_1_creator_8":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"1377","nameIdentifierScheme":"WEKO"}]}]},"item_1_description_1":{"attribute_name":"ページ属性","attribute_value_mlt":[{"subitem_description":"P(論文)","subitem_description_type":"Other"}]},"item_1_description_11":{"attribute_name":"抄録(日)","attribute_value_mlt":[{"subitem_description":"本論文では、離散組み合わせ問題、特に、地図の彩色問題とクロスワードパズル問題を制約充足問題として定式化するとともに、整合化手法を用いた制約充足解法を適用し、その有効性を示す。","subitem_description_language":"ja","subitem_description_type":"Other"}]},"item_1_description_12":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we describe a formalization of discrete combinatorial problems from viewpoint of constraint satisfaction problems and the consistency methods for constraint satisfaction problems. Effectiveness of these consistency methods is shown using application of these methods to map coloring problem and crossword puzzle problem.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_1_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15029/00000340","subitem_identifier_reg_type":"JaLC"}]},"item_1_source_id_13":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AA11155514","subitem_source_identifier_type":"NCID"}]},"item_1_text_10":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Tokyo University of Information Sciences,Faculty of Informatics,Department of Information Systems"}]},"item_1_text_9":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"東京情報大学総合情報学部情報システム学科"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2006-02-20"}],"displaytype":"detail","filename":"KJ00003985270.pdf","filesize":[{"value":"1.4 MB"}],"format":"application/pdf","license_note":"TUIS","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KJ00003985270","url":"https://tuis.repo.nii.ac.jp/record/341/files/KJ00003985270.pdf"},"version_id":"ec273905-4519-468e-828e-ffab62892576"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"制約充足問題","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"離散組み合わせ問題","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"定式化","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"整合化手法","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"効率性","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"constraint satisfaction problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"discrete combinatorial problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"formalization","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"consistency method","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"efficiency","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"離散組み合わせ問題の制約充足問題による定式化ならびに整合化手法の適用検討","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"離散組み合わせ問題の制約充足問題による定式化ならびに整合化手法の適用検討","subitem_title_language":"ja"},{"subitem_title":"Towards CSP Formalization of Discrete Combinatorial Problems and an Application of Consistency Techniques","subitem_title_language":"en"}]},"item_type_id":"1","owner":"3","path":["104"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2006-02-20"},"publish_date":"2006-02-20","publish_status":"0","recid":"341","relation_version_is_last":true,"title":["離散組み合わせ問題の制約充足問題による定式化ならびに整合化手法の適用検討"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-12-22T06:11:10.275582+00:00"}