{"links":{},"id":2005952,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02005952","sets":["6164:6165:6617:1762413724940"]},"path":["1762413724940"],"owner":"80578","recid":"2005952","title":["Falcon：ソルバー選択によるブラックボックス逐次化可能性問題の効率化"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2025-11-24"},"_buckets":{"deposit":"73955ff6-c283-4746-a7f6-d832a241b1ef"},"_deposit":{"id":"2005952","pid":{"type":"depid","value":"2005952","revision_id":0},"owners":[80578],"status":"published","created_by":80578},"item_title":"Falcon：ソルバー選択によるブラックボックス逐次化可能性問題の効率化","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Falcon：ソルバー選択によるブラックボックス逐次化可能性問題の効率化","subitem_title_language":"ja"}]},"item_type_id":"18","publish_date":"2025-11-24","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学"},{"subitem_text_value":"株式会社KDDI総合研究所"},{"subitem_text_value":"慶應義塾大学"}]},"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/2005952/files/IPSJ-ComSys2025010.pdf","label":"IPSJ-ComSys2025010.pdf"},"date":[{"dateType":"Available","dateValue":"2027-11-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ComSys2025010.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"af2744c0-a37e-41c0-849f-8552b1eba973","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"前田,航輝"}]},{"creatorNames":[{"creatorName":"斉藤,和広"}]},{"creatorNames":[{"creatorName":"川島,英之"}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"データベーストランザクションを並列に実行するとき，並列実行の結果と直列実行の結果が同等であるならば，逐次化可能であると言える．クラウドデータベース等のユーザーから見て内部実装が不透明な環境下において，逐次化可能性があるかどうか判定する問題はブラックボックス逐次化可能性問題と呼ばれ，NP完全問題に分類される．先行研究では本問題に対してSMTソルバー，量子アニーリング，量子アルゴリズムQAOAを適用している．量子アニーリングは現状最も効率的なソルバーであるが，ハードウェア上の制約により，実行可能な問題のサイズに制約がある．そこで本研究では，大規模な問題に対して適用可能なイジングマシンを導入した上で，問題のサイズによって最適なソルバーを選択して求解を行うシステムであるFalconを構築し，評価を行う．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"94","bibliographic_titles":[{"bibliographic_title":"コンピュータシステム・シンポジウム論文集"}],"bibliographicPageStart":"88","bibliographicIssueDates":{"bibliographicIssueDate":"2025-11-24","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2025"}]},"relation_version_is_last":true,"weko_creator_id":"80578"},"created":"2025-11-18T08:00:44.022945+00:00","updated":"2025-11-26T00:37:34.385657+00:00"}