{"updated":"2025-01-19T23:12:58.125998+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00195107","sets":["1164:1579:9681:9756"]},"path":["9756"],"owner":"44499","recid":"195107","title":["Approximate相互結合網を用いた巡回セールスマン問題の並列蟻コロニー最適化による解法の高速化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-03-10"},"_buckets":{"deposit":"0b4e7f38-dd48-496f-9c4f-08e09ffd3991"},"_deposit":{"id":"195107","pid":{"type":"depid","value":"195107","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Approximate相互結合網を用いた巡回セールスマン問題の並列蟻コロニー最適化による解法の高速化","author_link":["463667","463671","463668","463670","463669","463664","463665","463666"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Approximate相互結合網を用いた巡回セールスマン問題の並列蟻コロニー最適化による解法の高速化"},{"subitem_title":"Accelerating solution method by parallel ant colony optimization of traveling salesman problem using Approximate interconnection network","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アルゴリズム","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2019-03-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学"},{"subitem_text_value":"国立情報学研究所"},{"subitem_text_value":"国立情報学研究所"},{"subitem_text_value":"慶應義塾大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Keio University","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","subitem_text_language":"en"},{"subitem_text_value":"Keio University","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/195107/files/IPSJ-ARC19235027.pdf","label":"IPSJ-ARC19235027.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC19235027.pdf","filesize":[{"value":"783.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"92ee2e3a-6f64-495b-b682-f785457f4288","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"丹羽, 直也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"平澤, 将一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鯉渕, 道紘"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"天野, 英晴"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoya, Niwa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shoichi, Hirasawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Michihiro, Koibuchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hideharu, Amano","creatorNameLang":"en"}],"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":"我々は，通信路上で一定のビット誤りを許容することで，相互結合網の広帯域化と低遅延化を両立し，その結果，データセンターやスーパーコンピュータにおいて並列計算アプリケーション高速化を達成する Approximate ネットワークを提案している．誤りを許容する相互結合網を活用した上で正しい (許容誤差範囲内の) 計算結果を得られるかどうかは，アプリケーションの性質に依存する．本報告では，ケーススタディとして，NP 困難である巡回セールスマン問題の近似解を並列蟻コロニー最適化で求める手法を用いて Approximate ネットワークの高速化を効果を評価した．その結果，解の精度にほとんど影響を与えずに，問題サイズが 100 以上の場合は 5% 前後の高速化ができることがわかった．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2019-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"27","bibliographicVolumeNumber":"2019-ARC-235"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:00:07.380568+00:00","id":195107,"links":{}}