Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IA, CQ, MIKA (Joint) |
2022-09-15 14:55 |
Hokkaido |
Hokkaido Citizens Actives Center (Primary: On-site, Secondary: Online) |
[Invited Talk]
Artificial Intelligence Approaches for Curling Masahito Yamamoto (Hokkaido Univ.) CQ2022-32 |
Curling is a sport in which players compete for points by delivering stones on the ice, and is one of the official sport... [more] |
CQ2022-32 p.49 |
COMP |
2021-03-08 15:45 |
Online |
Online |
A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique (FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] |
COMP2020-35 pp.38-45 |
LOIS |
2020-03-12 11:30 |
Okinawa |
Nobumoto Ohama Memorial Hall (Cancelled but technical report was issued) |
Characterizing Part of Source Code by Combining Syntactic Attributes Ken Nakayama (Tsuda Univ.) LOIS2019-74 |
Locating and understanding parts of source code of interest is one of the primary tasks for a software engineer especial... [more] |
LOIS2019-74 pp.103-108 |
HWS, VLD [detail] |
2020-03-05 09:30 |
Okinawa |
Okinawa Ken Seinen Kaikan (Cancelled but technical report was issued) |
Monte Carlo Tree Search for routing of delivery drone Kota Iwasaki, Yasuhiro Takashima (Univ. of Kitakyushu) VLD2019-109 HWS2019-82 |
In recent years, delivery drone becomes realistic. Thus, it is important to solve the routing problem of delivery drone,... [more] |
VLD2019-109 HWS2019-82 pp.89-94 |
DE |
2019-06-22 10:50 |
Tokyo |
|
Efficient Similar Document Search over Encrypted Data On the Cloud Daisuke Aritomo (Univ. of Tsukuba), Chiemi Watanabe (NTUT) DE2019-7 |
More and more data owners are building information retrieval systems on cloud computing platforms, which provides scalab... [more] |
DE2019-7 pp.29-34 |
CAS, CS |
2019-03-08 11:05 |
Kanagawa |
Shonan Institute of Technology |
A Study on the Problem which Monte-Carlo-Tree-Search can Search Efficiently Tetsuhiro Kitade, Kunihiro Fujiyoshi (TUAT) CAS2018-140 CS2018-108 |
Monte-Carlo-Tree-Search is expected to be effective for the solution search of a combinatorial optimization problem and ... [more] |
CAS2018-140 CS2018-108 pp.9-14 |
IN, NS (Joint) |
2019-03-05 14:10 |
Okinawa |
Okinawa Convention Center |
Efficient Alternative Route Detection under Unknown Failure on SDN Network by Failure Probability Takumi Matsuura (Tokyo Tech), Hiroki Nakayama, Tsunemasa Hayash (BOSCO), Katsunori Yamaoka (Tokyo Tech) IN2018-141 |
In the network, the unknown failure which is hard to recover is called silent failure. To identify a failure point is so... [more] |
IN2018-141 pp.343-348 |
VLD, HWS (Joint) |
2018-03-01 10:30 |
Okinawa |
Okinawa Seinen Kaikan |
A Motif Extraction Method Using Monte-Carlo Tree Search and its Experimental Evaluation Yusuke Yuasa, Shinobu Nagayama, Masato Inagi, Shin'ichi Wakabayashi (Hiroshima City Univ.) VLD2017-108 |
Discovering a similar substring from multiple strings is called motif extraction. It is used in various fields including... [more] |
VLD2017-108 pp.115-120 |
AI |
2018-02-17 11:40 |
Tokyo |
|
Target search strategy using estimated view Kazuto Murakami, Jun Rokui (Shimane Univ) AI2017-24 |
Communication has generally been used for the target search. It is necessary to prepare the environment to communicate f... [more] |
AI2017-24 pp.37-42 |
WIT, SP |
2017-10-19 15:15 |
Fukuoka |
Tobata Library of Kyutech (Kitakyushu) |
Study on Spatial Search Behavioiur of a Congenitally Blind Person Kazuo Kamata (HumanCommunication) SP2017-40 WIT2017-36 |
This report deals with spatial search behaviour of one congenitally blind person in entirely unknown space. Since the b... [more] |
SP2017-40 WIT2017-36 pp.33-38 |
SIP, CAS, MSS, VLD |
2017-06-20 11:20 |
Niigata |
Niigata University, Ikarashi Campus |
Orthonormal Haar Transform with Arbitrary Size and Its Application to Image Matching Izumi Ito (Tokyo Inst. of Tech.) CAS2017-17 VLD2017-20 SIP2017-41 MSS2017-17 |
The aim of template matching is to find parts of an image that are correspondent to a given template. Template matching ... [more] |
CAS2017-17 VLD2017-20 SIP2017-41 MSS2017-17 pp.87-91 |
ET |
2016-09-24 15:55 |
Tottori |
Tottori University of Environmental Studies |
Lecture term search for foreign students that represent by a simple word and dissolve polysemy using WordNet and Wikipedia Naoki Takemura (Okayama Univ. of Science), Nobuyuki kobayashi (Sanyo Gakuen Univ.), Hiromitsu Shiina (Okayama Univ. of Science) ET2016-40 |
In recent years there has been an increasing trend of international exchange students arriving to study in Japan. A cert... [more] |
ET2016-40 pp.37-41 |
COMP, IPSJ-AL |
2016-06-24 16:10 |
Ishikawa |
|
Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx
-- Enumerating tilings by frontier-based search -- Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.) COMP2016-9 |
We treat with puzzles which are filled by copies of a polygon in the polygon enlarged in a certain scale. We call ... [more] |
COMP2016-9 pp.41-47 |
IBISML |
2016-03-17 16:10 |
Tokyo |
Institute of Statistical Mathematics |
Bayesian Monte-Carlo tree search method and its application to linear constrained nonlinear control problems Ryo Otsuki, Shin-ichi Maeda, Shin Ishii (Kyoto Univ.) IBISML2015-98 |
For the nonlinear dynamics where the state transition is nonlinear with respect to the input, in general, we cannot obta... [more] |
IBISML2015-98 pp.31-38 |
RECONF |
2015-09-18 09:25 |
Ehime |
Ehime University |
Trax solver based on machine-learned evaluation function Takuya Nakamichi, Yusuke Sonoda, Takayuki Matsuzaki, Motoki Amagasaki, Masahiro Iida, Morihiro Kuga, Toshinori Sueyoshi (Kumamoto Univ.) RECONF2015-33 |
We develop a solver of board game Trax. Our basic strategy is a common game tree search algorithm. We explore the best m... [more] |
RECONF2015-33 pp.7-12 |
AI |
2015-06-18 14:55 |
Tokyo |
|
A Study on Multiple Sampling and Cooperation Strategy for Stochastic Distributed Constraint Optimization Method Toshihiro Matsui (NITech) AI2015-7 |
Distributed Gibbs (DGibbs) is a sampling-based stochastic solution method for Distributed Constraint Optimization Proble... [more] |
AI2015-7 pp.37-42 |
IA, IPSJ-IOT, SITE [detail] |
2015-03-06 14:20 |
Fukushima |
|
Fast Searchable Encryption Scheme Using Single Bloom Filter and Its Evalustion Shunsuke Kimura, Hiroyuki Inaba (KIT) SITE2014-79 IA2014-111 |
Recently, cloud storage service which store several documents on the Internet has become widespread.
This has the remar... [more] |
SITE2014-79 IA2014-111 pp.227-232 |
IN, NV (Joint) |
2014-07-17 16:55 |
Hokkaido |
Hokkaido Univ. |
[Invited Talk]
Search Techinques and Distributed Computing in Computer Shogi Shogo Takeuchi (Hokkaido Univ.) IN2014-39 |
Computer Shogi has recently attracted media attention due to the results of Man-Machine matches between five professiona... [more] |
IN2014-39 pp.55-60 |
ICSS, ISEC, SITE, EMM, IPSJ-CSEC, IPSJ-SPT [detail] |
2014-07-04 13:50 |
Hokkaido |
San-Refure Hakodate |
Proposal on Fast Searchable Encryption Scheme Using Bloom Filter Shunsuke Kimura, Hiroyuki Inaba (Kyoto Inst. of Tech.) ISEC2014-40 SITE2014-35 ICSS2014-44 EMM2014-40 |
Recently, cloud storage service which store several documents on the Internet has become widespread.
This has the remar... [more] |
ISEC2014-40 SITE2014-35 ICSS2014-44 EMM2014-40 pp.281-286 |
COMP |
2014-03-10 15:05 |
Tokyo |
|
Safely-converging self-organization of a BFS tree with many leaves in virtual grid networks Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2013-70 |
We propose a safely-converging self-organization of a Breadth-First-Search spanning tree (BFS tree) with many leaves in ... [more] |
COMP2013-70 pp.69-76 |