{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00203207","sets":["1164:1579:10069:10141"]},"path":["10141"],"owner":"44499","recid":"203207","title":["重み付きグラフの最大マッチング問題における脳型計算を用いた近似解法の検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-02-20"},"_buckets":{"deposit":"15058981-8555-436b-bd1b-81c73873943c"},"_deposit":{"id":"203207","pid":{"type":"depid","value":"203207","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"重み付きグラフの最大マッチング問題における脳型計算を用いた近似解法の検討","author_link":["500220","500219"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"重み付きグラフの最大マッチング問題における脳型計算を用いた近似解法の検討"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アクセラレーション","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2020-02-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","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/203207/files/IPSJ-ARC20240022.pdf","label":"IPSJ-ARC20240022.pdf"},"date":[{"dateType":"Available","dateValue":"2022-02-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC20240022.pdf","filesize":[{"value":"466.9 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"35cc15cc-ac49-49ff-ada1-8477d65f77a6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"上野, 洋典"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"近藤, 正章"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，非ノイマン型の計算パラダイムとしてニューロモーフィックコンピューティング（脳型計算）が注目を集めている．本稿では脳型計算を用いて重み付きグラフの最大マッチング問題を近似的に解く手法を提案し，その手法が近似度 1/2 の Greedy アルゴリズムと同一の処理を行う手順であることを示す．特に，規模の異なるランダムグラフに対する提案手法を適用し，近似解の性能および計算量を評価した．その結果，大規模なグラフに対しては，厳密解に近い解が得られ，提案手法の優位性を確認した．また，提案したアルゴリズムを実行するニューロモーフィックなアーキテクチャを FPGA に実装し，実行時間を評価した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2020-02-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"22","bibliographicVolumeNumber":"2020-ARC-240"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":203207,"updated":"2025-01-19T20:37:59.455220+00:00","links":{},"created":"2025-01-19T01:05:38.830552+00:00"}