var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2Fstakeuch-lab%2Fstakeuch-lab.github.io%2Fmaster%2Fpapers.bib&group0=year&group1=type&fullnames=1&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2Fstakeuch-lab%2Fstakeuch-lab.github.io%2Fmaster%2Fpapers.bib&group0=year&group1=type&fullnames=1&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2Fstakeuch-lab%2Fstakeuch-lab.github.io%2Fmaster%2Fpapers.bib&group0=year&group1=type&fullnames=1&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n inproceedings\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n 長さ l の s-t パス数え上げのXCCとしての定式化.\n \n \n \n \n\n\n \n 松本 吏司; 原田 崇司; and 竹内 聖悟.\n\n\n \n\n\n\n In 電子情報通信学会総合大会 DS-2-04, March 2024. \n \n\n\n\n
\n\n\n\n \n \n \"長さ link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{matsumoto-ieice-2024, \n  author    = {松本 吏司 and 原田 崇司 and 竹内 聖悟},\n  title     = {長さ l の s-t パス数え上げのXCCとしての定式化},\n  booktitle = {電子情報通信学会総合大会 DS-2-04},\n  month     = mar,\n  year      = {2024},\n  url_Link  = {https://pub.confit.atlas.jp/ja/event/general2024/presentation/DS-2-04}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n article\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n 遺伝的プログラミングを用いたモンテカルロガイスターのプレイアウト方策生成.\n \n \n \n \n\n\n \n 竹内 聖悟; and 栃川 純平.\n\n\n \n\n\n\n 情報処理学会論文誌, 64(3): 708–716. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"遺伝的プログラミングを用いたモンテカルロガイスターのプレイアウト方策生成 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{takeuchi-tochikawa-ipsj-2023,\n  author    = {竹内 聖悟 and 栃川 純平},\n  title     = {遺伝的プログラミングを用いたモンテカルロガイスターのプレイアウト方策生成},\n  journal   = {情報処理学会論文誌},\n  year      = {2023},\n  volume    = {64},\n  pages     = {708--716},\n  number    = {3},\n  publisher = {情報処理学会},\n  url_link  = {http://id.nii.ac.jp/1001/00225268/}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n inproceedings\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n 動的計画法を用いたZDD上のForcingの探索.\n \n \n \n \n\n\n \n 原田 崇司; and 竹内 聖悟.\n\n\n \n\n\n\n In 電子情報通信学会コンピュテーション研究会(COMP2022-33), pages 1–6, March 2023. \n \n\n\n\n
\n\n\n\n \n \n \"動的計画法を用いたZDD上のForcingの探索 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{harada-comp-2023, \n  author    = {原田 崇司 and 竹内 聖悟},\n  title     = {動的計画法を用いたZDD上のForcingの探索},\n  booktitle = {電子情報通信学会コンピュテーション研究会(COMP2022-33)},\n  pages     = {1--6},\n  month     = mar,\n  year      = {2023},\n  url_Link  = {https://ken.ieice.org/ken/paper/20230302XCTm/}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 生物学的制約による人間らしい対戦テトリスAIの研究.\n \n \n \n \n\n\n \n 土居 海里; and 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2023論文集, pages 42–47, November 2023. \n \n\n\n\n
\n\n\n\n \n \n \"生物学的制約による人間らしい対戦テトリスAIの研究 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{doi-gpw-2023,\n   author    = {土居 海里 and 竹内 聖悟},\n   title     = {生物学的制約による人間らしい対戦テトリスAIの研究},\n   booktitle = {ゲームプログラミングワークショップ2023論文集},\n   pages     = {42--47},\n   month     = nov,\n   year      = {2023},\n   url_Link  = {http://id.nii.ac.jp/1001/00229231/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 将棋における平均悪手を用いた特徴と棋力の分析.\n \n \n \n \n\n\n \n 藤田 和音; and 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2023論文集, pages 88–93, November 2023. \n \n\n\n\n
\n\n\n\n \n \n \"将棋における平均悪手を用いた特徴と棋力の分析 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{fujita-gpw-2023,\n   author    = {藤田 和音 and 竹内 聖悟},\n   title     = {将棋における平均悪手を用いた特徴と棋力の分析},\n   booktitle = {ゲームプログラミングワークショップ2023論文集},\n   pages     = {88--93},\n   month     = nov,\n   year      = {2023},\n   url_Link  = {http://id.nii.ac.jp/1001/00229240/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n [企画講演]二人ボードゲームでの意思決定における複数ゲームAIの協調について.\n \n \n \n \n\n\n \n 竹内 聖悟.\n\n\n \n\n\n\n In 電子情報通信学会総合大会 エンターテインメントとシステム数理・制御通信, March 2023. \n \n\n\n\n
\n\n\n\n \n \n \"[企画講演]二人ボードゲームでの意思決定における複数ゲームAIの協調について link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-ieice-2023,\n   author    = {竹内 聖悟},\n   title     = {[企画講演]二人ボードゲームでの意思決定における複数ゲームAIの協調について},\n   booktitle = {電子情報通信学会総合大会 エンターテインメントとシステム数理・制御通信},\n   month     = mar,\n   year      = {2023},\n   url_Link  = {https://www.ieice-taikai.jp/2023general/jpn/webpro/_html/ess_kikaku.html#ak_1}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n article\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n 不完全情報ゲーム「ガイスター」における相手駒色推定の有効性評価.\n \n \n \n \n\n\n \n 竹内 聖悟; 栃川 純平; and 松崎 公紀.\n\n\n \n\n\n\n 情報処理学会論文誌, 63(3): 787–795. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"不完全情報ゲーム「ガイスター」における相手駒色推定の有効性評価 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{takeuchi-tochikawa-ipsj-2022,\n  author    = {竹内 聖悟 and 栃川 純平 and 松崎 公紀},\n  title     = {不完全情報ゲーム「ガイスター」における相手駒色推定の有効性評価},\n  journal   = {情報処理学会論文誌},\n  year      = {2022},\n  volume    = {63},\n  pages     = {787--795},\n  number    = {3},\n  publisher = {情報処理学会},\n  url_link  = {http://id.nii.ac.jp/1001/00217475/}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n inproceedings\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Comparison of Search Behaviors in Chess, Shogi, and the game of Go.\n \n \n \n \n\n\n \n Shogo Takeuchi.\n\n\n \n\n\n\n In 2022 International Conference on Technologies and Applications of Artificial Intelligence (TAAI), pages 183–188, December 2022. \n \n\n\n\n
\n\n\n\n \n \n \"Comparison link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-taai-2022,\n  author    = {Shogo Takeuchi},\n  title     = {Comparison of Search Behaviors in Chess, Shogi, and the game of Go},\n  booktitle = {2022 International Conference on Technologies and Applications of Artificial Intelligence (TAAI)},\n  pages     = {183--188},\n  month     = dec,\n  year      = {2022},\n  url_Link  = {https://ieeexplore.ieee.org/document/10056467}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n [招待講演]二人ボードゲームにおける複数ゲームAIの協調について.\n \n \n \n \n\n\n \n 竹内 聖悟.\n\n\n \n\n\n\n In 電子情報通信学会技術研究報告 コンピュテーション研究会, pages 31, December 2022. \n \n\n\n\n
\n\n\n\n \n \n \"[招待講演]二人ボードゲームにおける複数ゲームAIの協調について link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-comp-2022,\n   author    = {竹内 聖悟},\n   title     = {[招待講演]二人ボードゲームにおける複数ゲームAIの協調について},\n   booktitle = {電子情報通信学会技術研究報告 コンピュテーション研究会},\n   pages     = {31},\n   month     = dec,\n   year      = {2022},\n   url_Link  = {https://ken.ieice.org/ken/paper/20221206ACPJ/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 人間プレイヤの戦略を推定し,系列情報を用いて人間の模倣を行う麻雀プレイヤの作成.\n \n \n \n \n\n\n \n 前川 幸輝; and 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2022論文集, pages 118–122, November 2022. \n \n\n\n\n
\n\n\n\n \n \n \"人間プレイヤの戦略を推定し,系列情報を用いて人間の模倣を行う麻雀プレイヤの作成 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{maekawa-gpw-2022,\n   author    = {前川 幸輝 and 竹内 聖悟},\n   title     = {人間プレイヤの戦略を推定し,系列情報を用いて人間の模倣を行う麻雀プレイヤの作成},\n   booktitle = {ゲームプログラミングワークショップ2022論文集},\n   pages     = {118--122},\n   month     = nov,\n   year      = {2022},\n   url_Link  = {http://id.nii.ac.jp/1001/00221892/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 対戦テトリスにおける評価値を利用した動的難易度調整.\n \n \n \n \n\n\n \n 土居 海里; and 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2022論文集, pages 144–150, November 2022. \n \n\n\n\n
\n\n\n\n \n \n \"対戦テトリスにおける評価値を利用した動的難易度調整 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{doi-gpw-2022,\n   author    = {土居 海里 and 竹内 聖悟},\n   title     = {対戦テトリスにおける評価値を利用した動的難易度調整},\n   booktitle = {ゲームプログラミングワークショップ2022論文集},\n   pages     = {144--150},\n   month     = nov,\n   year      = {2022},\n   url_Link  = {http://id.nii.ac.jp/1001/00221897/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 人狼知能における共謀の有効性.\n \n \n \n \n\n\n \n 田頭 裕; and 竹内 聖悟.\n\n\n \n\n\n\n In 情報処理学会研究会報告, volume 2022-GI-48, pages 1–7, July 2022. \n \n\n\n\n
\n\n\n\n \n \n \"人狼知能における共謀の有効性 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{tagashira-siggi48-2022,\n   author    = {田頭 裕 and 竹内 聖悟},\n   title     = {人狼知能における共謀の有効性},\n   booktitle = {情報処理学会研究会報告},\n   volume    = {2022-GI-48},\n   number    = {9},\n   pages     = {1--7},\n   month     = jul,\n   year      = {2022},\n   url_Link  = {http://id.nii.ac.jp/1001/00218631/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 探索結果の評価値に基づく手選択の工夫による相手に合わせた将棋AI.\n \n \n \n \n\n\n \n 荒武 佑磨; 松崎 公紀; and 竹内 聖悟.\n\n\n \n\n\n\n In 情報処理学会研究会報告, volume 2022-GI-48, pages 1–5, July 2022. \n \n\n\n\n
\n\n\n\n \n \n \"探索結果の評価値に基づく手選択の工夫による相手に合わせた将棋AI link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{aratake-siggi48-2022,\n   author    = {荒武 佑磨 and 松崎 公紀 and 竹内 聖悟},\n   title     = {探索結果の評価値に基づく手選択の工夫による相手に合わせた将棋AI},\n   booktitle = {情報処理学会研究会報告},\n   volume    = {2022-GI-48},\n   number    = {4},\n   pages     = {1--5},\n   month     = jul,\n   year      = {2022},\n   url_Link  = {http://id.nii.ac.jp/1001/00218626/}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n inproceedings\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n モンテカルロ木探索ガイスターにおける遺伝的プログラミングを用いたプレイアウト方策の作成.\n \n \n \n \n\n\n \n 栃川 純平; and 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2021論文集, pages 124–129, November 2021. \n \n\n\n\n
\n\n\n\n \n \n \"モンテカルロ木探索ガイスターにおける遺伝的プログラミングを用いたプレイアウト方策の作成 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{tochikawa-gpw-2021,\n   author\t = {栃川 純平 and 竹内 聖悟},\n   title\t = {モンテカルロ木探索ガイスターにおける遺伝的プログラミングを用いたプレイアウト方策の作成},\n   booktitle\t = {ゲームプログラミングワークショップ2021論文集},\n   pages\t = {124--129},\n   month\t = nov,\n   year \t = {2021},\n   url_link      = {http://id.nii.ac.jp/1001/00213337/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 対局者の分類とモデル構築により各人を模倣する麻雀プレイヤ.\n \n \n \n \n\n\n \n 前川 幸輝; and 竹内 聖悟.\n\n\n \n\n\n\n In 情報処理学会研究会報告, volume 2021-GI-46, pages 1–8, June 2021. \n \n\n\n\n
\n\n\n\n \n \n \"対局者の分類とモデル構築により各人を模倣する麻雀プレイヤ link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{maekawa-siggi-2021,\n  author    = {前川 幸輝 and 竹内 聖悟},\n  title     = {対局者の分類とモデル構築により各人を模倣する麻雀プレイヤ},\n  booktitle = {情報処理学会研究会報告},\n  volume    = {2021-GI-46},\n  number    = {10},\n  pages     = {1--8},\n  month     = jun,\n  year      = {2021},\n  url_Link  = {http://id.nii.ac.jp/1001/00211394/}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n article\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Circ1P分割問題の計算困難性とSATソルバを用いたその解法.\n \n \n \n \n\n\n \n 原田 崇司; and 竹内 聖悟.\n\n\n \n\n\n\n 電子情報通信学会論文誌 D, J103-D(11): 800–807. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Circ1P分割問題の計算困難性とSATソルバを用いたその解法 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{harada-ieice-2020,\n  author    = {原田 崇司 and 竹内 聖悟},\n  title     = {Circ1P分割問題の計算困難性とSATソルバを用いたその解法},\n  journal   = {電子情報通信学会論文誌 D},\n  year      = {2020},\n  volume    = {J103-D},\n  pages     = {800--807},\n  number    = {11},\n  publisher = {電子情報通信学会},\n  url_link  = {https://search.ieice.org/bin/summary.php?id=j103-d_11_800&category=D&lang=J&year=2020&abst=}\n}\n\n% International Conference papers\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n inproceedings\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n ガイスターの初期盤面における相手駒推定の有効性.\n \n \n \n \n\n\n \n 栃川 純平; and 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2020論文集, pages 10–15, November 2020. \n \n\n\n\n
\n\n\n\n \n \n \"ガイスターの初期盤面における相手駒推定の有効性 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{tochikawa-gpw-2020,\n  author    = {栃川 純平 and 竹内 聖悟},\n  title     = {ガイスターの初期盤面における相手駒推定の有効性},\n  booktitle = {ゲームプログラミングワークショップ2020論文集},\n  pages     = {10--15},\n  month     = nov,\n  year      = {2020},\n  url_Link  = {http://id.nii.ac.jp/1001/00207545/}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ポインタ付連分割トライに基づく決定図によるパケット分類法.\n \n \n \n \n\n\n \n 原田 崇司; 竹内 聖悟; 田中 賢; and 三河 賢治.\n\n\n \n\n\n\n In 情報処理学会研究会報告, volume 2020-AL-178, pages 1–8, May 2020. \n \n\n\n\n
\n\n\n\n \n \n \"ポインタ付連分割トライに基づく決定図によるパケット分類法 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{harada-al-2020,\n  author    = {原田 崇司 and 竹内 聖悟 and 田中 賢 and 三河 賢治},\n  title     = {ポインタ付連分割トライに基づく決定図によるパケット分類法},\n  booktitle = {情報処理学会研究会報告},\n  volume    = {2020-AL-178},\n  number    = {11},\n  pages     = {1--8},\n  month     = may,\n  year      = {2020},\n  url_Link  = {http://id.nii.ac.jp/1001/00204436/}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n inproceedings\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Advice is Useful for Game AI: Experiments with Alpha-Beta Search Players in Shogi.\n \n \n \n \n\n\n \n Shogo Takeuchi.\n\n\n \n\n\n\n In 16th International Conference, ACG 2019, volume 12516, of Lecture Notes in Computer Science, pages 1–10, 2019. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AdvicePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-acg-2019,\n  author    = {Shogo Takeuchi},\n  title     = {Advice is Useful for Game {AI:} Experiments with Alpha-Beta Search\n               Players in Shogi},\n  booktitle = {16th International Conference, {ACG} 2019},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {12516},\n  pages     = {1--10},\n  publisher = {Springer},\n  year      = {2019},\n  url       = {https://doi.org/10.1007/978-3-030-65883-0_1},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n プレイアウト回数増加に伴うモンテカルロ木探索の振舞い.\n \n \n \n \n\n\n \n 竹内 聖悟.\n\n\n \n\n\n\n In ゲームプログラミングワークショップ2019論文集, pages 66–72, November 2019. \n \n\n\n\n
\n\n\n\n \n \n \"プレイアウト回数増加に伴うモンテカルロ木探索の振舞い link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{takeuchi-gpw-2019,\n  author    = {竹内 聖悟},\n  title     = {プレイアウト回数増加に伴うモンテカルロ木探索の振舞い},\n  booktitle = {ゲームプログラミングワークショップ2019論文集},\n  pages     = {66--72},\n  month     = nov,\n  year      = {2019},\n  url_Link  = {http://id.nii.ac.jp/1001/00199881/}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Circ1P分割問題の計算複雑さと解法.\n \n \n \n \n\n\n \n 竹内 聖悟; and 原田 崇司.\n\n\n \n\n\n\n In 電子情報通信学会コンピュテーション研究会(COMP2019-25), pages 53–56, October 2019. \n \n\n\n\n
\n\n\n\n \n \n \"Circ1P分割問題の計算複雑さと解法 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-comp-2019, \n  author    = {竹内 聖悟 and 原田 崇司},\n  title     = {Circ1P分割問題の計算複雑さと解法},\n  booktitle = {電子情報通信学会コンピュテーション研究会(COMP2019-25)},\n  pages     = {53--56},\n  month     = oct,\n  year      = {2019},\n  url_Link  = {https://www.ieice.org/ken/paper/2019102531QU/}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SATソルバを用いたC1P分割問題の解法.\n \n \n \n \n\n\n \n 原田 崇司; and 竹内 聖悟.\n\n\n \n\n\n\n In 第18回情報科学技術フォーラム(FIT 2019), September 2019. \n \n\n\n\n
\n\n\n\n \n \n \"SATソルバを用いたC1P分割問題の解法 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{harada-fit-2019, \n  author    = {原田 崇司 and 竹内 聖悟},\n  title     = {SATソルバを用いたC1P分割問題の解法},\n  booktitle = {第18回情報科学技術フォーラム(FIT 2019)},\n  month     = sep,\n  year      = {2019},\n  url_Link  = {https://www.ipsj.or.jp/event/fit/fit2019/FIT2019program_web/data/html/abstract/CA-006.html}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n inproceedings\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Weighted Majority Voting with a Heterogeneous System in the Game of Shogi.\n \n \n \n \n\n\n \n Shogo Takeuchi.\n\n\n \n\n\n\n In 2018 Conference on Technologies and Applications of Artificial Intelligence (TAAI2018), pages 122–125, December 2018. \n \n\n\n\n
\n\n\n\n \n \n \"Weighted link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-taai-2018,\n  author    = {Shogo Takeuchi},\n  title     = {Weighted Majority Voting with a Heterogeneous System in the Game of Shogi},\n  booktitle = {2018 Conference on Technologies and Applications of Artificial Intelligence (TAAI2018)},\n  pages     = {122--125},\n  month     = dec,\n  year      = {2018},\n  url_Link  = {https://ieeexplore.ieee.org/document/8588491}\n}\n\n% Domestic Workshop papers\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 二分決定図による複数の線形モデルの出力値公開の安全性評価と疾患リスク予測値公開への適用.\n \n \n \n \n\n\n \n 竹内 聖悟; 津田 宏治; and 佐久間 淳.\n\n\n \n\n\n\n In コンピュータセキュリティシンポジウム2018論文集, pages 785–792, October 2018. \n \n\n\n\n
\n\n\n\n \n \n \"二分決定図による複数の線形モデルの出力値公開の安全性評価と疾患リスク予測値公開への適用 link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-css-2018,\n  author    = {竹内 聖悟 and 津田 宏治 and 佐久間 淳},\n  title     = {二分決定図による複数の線形モデルの出力値公開の安全性評価と疾患リスク予測値公開への適用},\n  booktitle = {コンピュータセキュリティシンポジウム2018論文集},\n  pages     = {785--792},\n  month     = oct,\n  year      = {2018},\n  url_Link  = {http://id.nii.ac.jp/1001/00192117/}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n 異種プログラム間における楽観合議について.\n \n \n \n \n\n\n \n 竹内 聖悟.\n\n\n \n\n\n\n In 情報処理学会研究会報告, volume 2018-GI-40, pages 1–7, June 2018. \n \n\n\n\n
\n\n\n\n \n \n \"異種プログラム間における楽観合議について link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@INPROCEEDINGS{takeuchi-siggi-2018,\n  author    = {竹内 聖悟},\n  title     = {異種プログラム間における楽観合議について},\n  booktitle = {情報処理学会研究会報告},\n  volume    = {2018-GI-40},\n  number    = {8},\n  pages     = {1--7},\n  month     = jun,\n  year      = {2018},\n  url_Link  = {http://id.nii.ac.jp/1001/00190228/}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);