{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00131030","sets":["6504:8126:8128"]},"path":["8128"],"owner":"1","recid":"131030","title":["ナップザック問題における解法拡張可能性の分析"],"pubdate":{"attribute_name":"公開日","attribute_value":"1997-03-12"},"_buckets":{"deposit":"05f1018d-d970-4e03-bf2e-9f594516f69d"},"_deposit":{"id":"131030","pid":{"type":"depid","value":"131030","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":"Analyzing Possibilities of Extending Solution in Knapsack Problem","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1997-03-12","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":"Dept. of Computer Science, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Computer Science, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Computer Science, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Computer Science, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Computer Science, Tokyo University of Agriculture and Technology","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/131030/files/KJ00001344773.pdf"},"date":[{"dateType":"Available","dateValue":"1997-03-12"}],"format":"application/pdf","filename":"KJ00001344773.pdf","filesize":[{"value":"140.3 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"23c7a9ac-b76e-4f1b-96fb-29b5caa14044","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":"ナップザック問題は代表的なNP完全問題であり、一般には多項式時間で解く方法は見つかっていない。しかし、ナップザックベクトルA={a_1,a_2,・・・, a_n} の大ぎさnと、その要素の最大ビット数x=log_2(max{a_1,a_2,・・・, a_n})から、d=m/xで定義される密度dが低い場合に限り、多項式時間で解く方法が知られている。本研究では、L^3アルゴリズムを用いた低密度ナップザック問題解決法、アルゴリズムSVを実現する方法について研究した。本稿ではその概要を報告する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"274","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"273","bibliographicIssueDates":{"bibliographicIssueDate":"1997-03-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"ソフトウェア科学・工学","bibliographicVolumeNumber":"第54回"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-20T23:54:23.723589+00:00","created":"2025-01-19T00:10:01.210576+00:00","links":{},"id":131030}