Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Maruyama, Shirou"'
Inventory management in warehouses directly affects profits made by manufacturers. Particularly, large manufacturers produce a very large variety of products that are handled by a significantly large number of retailers. In such a case, the computati
Externí odkaz:
http://arxiv.org/abs/2204.13378
Autor:
Nishiyama, Daisuke, Castro, Mario Ynocente, Maruyama, Shirou, Shiroshita, Shinya, Hamzaoui, Karim, Ouyang, Yi, Rosman, Guy, DeCastro, Jonathan, Lee, Kuan-Hui, Gaidon, Adrien
Publikováno v:
The 23rd IEEE International Conference on Intelligent Transportation Systems (ITSC2020)
Automated Vehicles require exhaustive testing in simulation to detect as many safety-critical failures as possible before deployment on public roads. In this work, we focus on the core decision-making component of autonomous robots: their planning al
Externí odkaz:
http://arxiv.org/abs/2011.11991
Autor:
Shiroshita, Shinya, Maruyama, Shirou, Nishiyama, Daisuke, Castro, Mario Ynocente, Hamzaoui, Karim, Rosman, Guy, DeCastro, Jonathan, Lee, Kuan-Hui, Gaidon, Adrien
Publikováno v:
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2020, pp. 2103-2110
Traffic simulators are important tools in autonomous driving development. While continuous progress has been made to provide developers more options for modeling various traffic participants, tuning these models to increase their behavioral diversity
Externí odkaz:
http://arxiv.org/abs/2011.05741
Autor:
Maruyama, Shirou, Tabei, Yasuo
We present novel variants of fully online LCA (FOLCA), a fully online grammar compression that builds a straight line program (SLP) and directly encodes it into a succinct representation in an online manner. FOLCA enables a direct encoding of an SLP
Externí odkaz:
http://arxiv.org/abs/1401.5143
Autor:
Goto, Keisuke, Maruyama, Shirou, Inenaga, Shunsuke, Bannai, Hideo, Sakamoto, Hiroshi, Takeda, Masayuki
We consider the problem of {\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string $T$ produced by any grammar-based compression algorithm, to repr
Externí odkaz:
http://arxiv.org/abs/1107.2729
Practical data structures for the edit-sensitive parsing (ESP) are proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is represented by a DAG. Using the succinct data structures for trees and p
Externí odkaz:
http://arxiv.org/abs/1101.0080
Autor:
Maruyama, Shirou1 shiro.maruyama@i.kyushu-u.ac.jp, Sakamoto, Hiroshi hiroshi@ai.kyutech.ac.jp, Takeda, Masayuki1 takeda@inf.kyushu-u.ac.jp
Publikováno v:
Algorithms. Jun2012, Vol. 5 Issue 2, p214-235. 22p. 5 Diagrams, 3 Charts.
Publikováno v:
数理解析研究所講究録. 1744:209-212
Publikováno v:
数理解析研究所講究録. 1744:115-122
Practical data structures for the edit-sensitive parsing (ESP) are proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is represented by a DAG. Using the succinct data structures for trees and p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e604cbc08967fa49bd5ec30ea10f1f0