{"updated":"2025-01-22T16:52:43.546686+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00030896","sets":["1164:2386:2457:2466"]},"path":["2466"],"owner":"1","recid":"30896","title":["非探索アルゴリズムによるn_queen問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1990-05-24"},"_buckets":{"deposit":"bc3ce681-97f0-4da9-bf1c-b618ac8eb371"},"_deposit":{"id":"30896","pid":{"type":"depid","value":"30896","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"非探索アルゴリズムによるn_queen問題の解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"非探索アルゴリズムによるn_queen問題の解法"},{"subitem_title":"Non - Searching Algorithms for the n_Queen Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1990-05-24","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学電子情報学科"},{"subitem_text_value":"電気通信大学電子情報学科"},{"subitem_text_value":"電気通信大学電子情報学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Dept. of Commun. & Systems, The Univ. of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Commun. & Systems, The Univ. of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Commun. & Systems, The Univ. of Electro - Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/30896/files/IPSJ-PRO90035010.pdf"},"date":[{"dateType":"Available","dateValue":"1992-05-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-PRO90035010.pdf","filesize":[{"value":"639.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":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"de9f6b0f-a009-4d5f-9987-a83399a8e699","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1990 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山田, 義朗"},{"creatorName":"富田, 悦次"},{"creatorName":"高橋, 治久"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshiaki, Yamada","creatorNameLang":"en"},{"creatorName":"Etsuji, Tomita","creatorNameLang":"en"},{"creatorName":"Haruhisa, Takahashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10485570","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"n_queen問題は探索アルゴリズムの例題としてよく取上げられる。しかしながら、探索アルゴリズムは問題のサイズが大きくなると現実的な時間で解が得られないことが多い。ここでは、n_queen問題を解く2つの非探索アルゴリズムを提唱する。どちらのアルゴリズムも、モンテカルロ法による近似最大独立節点集合(）抽出アルゴリズムを基本にして効率化を行なったものである。計算機実験によりこれまでに20000　queen問題の解が得られており、アルゴリズムの効率の良さが伺える。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"An n_queen problem is one of typical problems which can be solved by searching methods. In many cases, the time required for such searching algorithms is very huge. In this note, we propose two non-searching algorithms for the n_queen problem that which are based upon a Monte-Carlo algorithm for finding a near-maximum independent set (MIS). We present some experimental results of these algorithms for up to 20000 queens.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"92","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告プログラミング（PRO）"}],"bibliographicPageStart":"87","bibliographicIssueDates":{"bibliographicIssueDate":"1990-05-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"44(1990-PRO-035)","bibliographicVolumeNumber":"1990"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:00:22.477977+00:00","id":30896,"links":{}}