Search Results 1-20 of 1505

  • Monte Carlo Tree Search Method for Knapsack Problems  [in Japanese]

    飯間 等 , 兵野 拓海

    電気学会研究会資料. ST 2020(7-13), 1-4, 2020-03-08

  • Monte Carlo Tree Search for routing of delivery drone  [in Japanese]

    岩﨑 宏太 , 髙島 康裕

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(444), 89-94, 2020-03-04

  • Monte Carlo Tree Search for routing of delivery drone  [in Japanese]

    岩﨑 宏太 , 髙島 康裕

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(443), 89-94, 2020-03-04

  • Reinforcement Learning to Create Value and Policy Functions Using Minimax Tree Search in Hex

    Takada Kei , Iizuka Hiroyuki , Yamamoto Masahito

    IEEE Transactions on Games 12(1), 63-73, 2020-03


  • An Investigation for Automatic Design of Electromagnetic Devices Using Reinforcement Learning  [in Japanese]

    佐藤 孝洋 , 藤田 真史

    電気学会研究会資料. RM 2020(16-30), 19-24, 2020-01-24

  • An Investigation for Automatic Design of Electromagnetic Devices Using Reinforcement Learning  [in Japanese]

    佐藤 孝洋 , 藤田 真史

    電気学会研究会資料. SA 2020(16-30), 19-24, 2020-01-24

  • Automatic adjustment of decay factor in Tree Reuse MCTS  [in Japanese]

    YOKOGAWA Kota , MORIYAMA Koichi , MUTOH Atsuko , MATSUI Tohgoroh , INUZUKA Nobuhiro

    … <p>MCTS is a best-first search algorithm that gradually expands a search tree based on the results of random searches. … One of its extensions is called "Tree Reuse". … Experiments using multiple game environments show that the proposal is better than the conventional Tree Reuse MCTS in the finish rate of the games.</p> …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 4B3GS104-4B3GS104, 2020


  • Mastering a Game with Imperfect Information by Game Tree Search with a Latently Learned Model:In the Case of "Gyakuten Othellonia"  [in Japanese]

    SAKODA Shintaro , OHTO Katsuki , TANAKA Ikki , KONO Yu

    … <p>In the field of board game AI, a technique that combines neural networks and tree search has attracted attention. … In order to perform a tree search, the transition rules of the board need to be known. …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 2J5GS205-2J5GS205, 2020


  • Fast Enumeration of Pairs of Minimal Generators and Their Closure Itemsets  [in Japanese]

    NABESHIMA Takahiro , IWANUMA Koji

    … We give a fast method for enumerating pairs of minimal generators and their closure itensets, which takes the form of a depth-first search over a suffix tree consisting of frequent minimal generators only. …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 2N4OS17a04-2N4OS17a04, 2020


  • A Miscellaneous Joint-Learning Model for Audience Segmentation in Online Advertising  [in Japanese]

    CHEN Weichang , YOSHIHARA Thomas , KUROYANAGI Shigeru , ZHUANG Yan

    … In this work, we append other features typically present in digital advertising setups, such as user search queries, to the device browser history. … Experiments on two online advertising datasets validate our model performs better than the broadly adapted ensemble tree model.</p> …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 1K5ES203-1K5ES203, 2020


  • Recommender system based on personal kansei evaluation tendency

    KONDO Yuya , TAKENOUCHI Hiroshi , TOKUMARU Masataka

    … The features are acquired from the image of the content by using a deep neural network, and the user evaluation for each feature is estimated by applying the gradient boosting decision tree. … In addition, we analyze the relationship between the user evaluation and the image feature, and search for the users with the similar evaluation tendency with regard to changes in the feature. …

    International Symposium on Affective Science and Engineering ISASE2020(0), 1-4, 2020


  • Representation and Learning Methods for Situation Evaluation in RoboCup Soccer Simulation

    AKIYAMA Hidehisa , NAKASHIMA Tomoharu , IGARASHI Harukazu

    … Next, a search method based on action chains is presented as a mechanism of action selection by a soccer player. … This method is based on the look-ahead of field situations by the combination of a search tree and a situation evaluation model, which is the case in the chess and shogi programs. …

    Journal of Japan Society for Fuzzy Theory and Intelligent Informatics 32(2), 691-703, 2020


  • Examination of new development theme search method Use of "alpha idea creation method"  [in Japanese]

    SAUCHI Toshihiro , NORIMUNE Fumiko , TSUDUKI Izumi , OMORI Teruo

    … is: 1) "Individual work" in which an individual freely creates ideas, 2) "group work" in which Create a functional tree map, grouping or hierarchically ideas obtained in individual work, 3) "bird's-eye work" apply an existing patent to the classification of three functional tree maps, and create a functional bird's-eye map that represents the correspondence between ideas and known technologies, 4) "Proposal work" to identify the attack point by adding the strength of the company and the market environment to the …

    The Journal of Information Science and Technology Association 70(3), 149-153, 2020


  • Solving the Steiner tree problem in graphs by chaotic search

    Fujita Misa , Kimura Takayuki , Ikeguchi Tohru

    … <p>The Steiner tree problem in graphs is an <i>NP</i>-hard combinatorial optimization problem. … To solve the <i>NP</i>-hard combinatorial optimization problems, such as the traveling salesman problems, the quadratic assignment problems, and the vehicle routing problems, an algorithm for searching solutions by chaotic dynamics, or the chaotic search, exhibits good performance. …

    Nonlinear Theory and Its Applications, IEICE 11(1), 90-108, 2020


  • Efficient Supergraph Search Using Graph Coding

    IMAI Shun , INOKUCHI Akihiro

    … In the proposed method, the search index does not require any knowledge of the query set or the frequent subgraph patterns. … The proposed method overcomes these difficulties through graph coding, using a tree structured index that contains infrequent subgraph patterns in the shallow part of the tree. …

    IEICE Transactions on Information and Systems E103.D(1), 130-141, 2020




    … The algorithm for this procedure is called a "depth-first search," and the practical steps for solving this Panel Exercise are as shown in Fig. 6. … However, it is noted that this kind of search tree sets off a "combinatorial explosion" according to an increase in the number of pieces. … Efficient pruning of the search tree is required to avoid unnecessary calculations. …

    Journal of Architecture and Planning (Transactions of AIJ) (766), 2679-2686, 2019-12



    NOBATA Tsuyoshi , HONMA Yudai , IMAI Kotaro

    … We also analyze the connectivity of each inner convex space by connecting centroids by a minimum spanning tree (MST) based on the similarity. … Future prospects include developing methods applicable to more complex buildings, extending the method to three dimensions, and establishing useful search methods.</p> …

    Journal of Architecture and Planning (Transactions of AIJ) (766), 2545-2552, 2019-12


  • Player Adaptive Motion Gaming AI for Health Promotion  [in Japanese]

    許 俊傑 , 問馬 樹 , 方 舟 , パリヤワン プージャナー , 原田 智広 , ターウォンマット ラック

    ゲームプログラミングワークショップ2019論文集 (2019), 221-226, 2019-11-01


  • Analysis of performance of Monte Carlo tree search with grouping  [in Japanese]

    坪倉 弘治 , 西野 順二

    ゲームプログラミングワークショップ2019論文集 (2019), 144-149, 2019-11-01


  • A Survey on AlphaZero Algorithm through Dobutsu Shogi  [in Japanese]

    中屋敷 太一 , 金子 知適

    ゲームプログラミングワークショップ2019論文集 (2019), 86-93, 2019-11-01


Page Top