Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Ryo Yoshinaka"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 140-153 (2019)
We propose a query learning algorithm for residual symbolic finite automata (RSFAs). Symbolic finite automata (SFAs) are finite automata whose transitions are labeled by predicates over a Boolean algebra, in which a big collection of characters leadi
Externí odkaz:
https://doaj.org/article/49f2233ff7f54c648f6d21a958f2e16b
Publikováno v:
Algorithms, Vol 12, Iss 4, p 73 (2019)
A multi-track string is a tuple of strings of the same length. Given the pattern and text of two multi-track strings, the permuted pattern matching problem is to find the occurrence positions of all permutations of the pattern in the text. In this pa
Externí odkaz:
https://doaj.org/article/4a62dbb11cc14fd0ba9e2be7fa549cc2
Autor:
Shin-ichi Minato, Koji Tsuruma, Hiroaki Iwashita, Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara
Publikováno v:
Algorithms, Vol 5, Iss 2, Pp 176-213 (2012)
Link puzzles involve finding paths or a cycle in a grid that satisfy given local and global properties. This paper proposes algorithms that enumerate solutions and instances of two link puzzles, Slitherlink and Numberlink, by zero-suppressed binary d
Externí odkaz:
https://doaj.org/article/e8d4bf7509dd4ca38f67ce7549273c20
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::519f8f9394ef333038c875abb2521922
https://doi.org/10.1007/978-3-031-27051-2_14
https://doi.org/10.1007/978-3-031-27051-2_14
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f47f680309bb5235f12844a773880aaf
https://doi.org/10.1007/978-3-031-27051-2_11
https://doi.org/10.1007/978-3-031-27051-2_11
Publikováno v:
Theoretical Computer Science. 812:187-202
We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk on that graph. It has been known that this problem is solvable in O ( n log n ) time when the targets are path or cycle graphs. This paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::443eac14df16c79bb8a8a7087070340b
https://doi.org/10.1016/j.tcs.2019.10.029
https://doi.org/10.1016/j.tcs.2019.10.029
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 140-153 (2019)
GandALF
GandALF
We propose a query learning algorithm for residual symbolic finite automata (RSFAs). Symbolic finite automata (SFAs) are finite automata whose transitions are labeled by predicates over a Boolean algebra, in which a big collection of characters leadi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22b278e0c442e81f521a56b532e714a0
https://doaj.org/article/49f2233ff7f54c648f6d21a958f2e16b
https://doaj.org/article/49f2233ff7f54c648f6d21a958f2e16b
Autor:
Ryo Yoshinaka
Publikováno v:
Journal of Computer and System Sciences. 104:359-374
Approaches based on the idea generically called distributional learning have been making great success in the algorithmic learning of several rich subclasses of context-free languages and their extensions. Those language classes are defined by proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::932c092fcd3d42b281eaa238cc79dbec
https://doi.org/10.1016/j.jcss.2017.07.004
https://doi.org/10.1016/j.jcss.2017.07.004
Publikováno v:
Journal of Graph Algorithms and Applications. 23:29-70
The problems of Permutation Routing via Matching and Token Swapping are reconfiguration problems on graphs. This paper is concerned with the complexity of those problems and a colored variant. For a given graph where each vertex has a unique token on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c081f68c3e5158cb69b4d2e1dd464e91
https://doi.org/10.7155/jgaa.00483
https://doi.org/10.7155/jgaa.00483
Autor:
Ryo Yoshinaka, Takeshi Shibata
Publikováno v:
Reinforcement Learning
In this chapter, we introduce the notion of simple context-free decision processes, which are an extension of episodic finite-state Markov decision processes (MDPs). Intuitively, a simple context-free decision process can be thought of as an episodic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b222bed81c7bacc00c7478528391db45
http://www.intechopen.com/articles/show/title/an_extension_of_finite-state_markov_decision_process_and_an_application_of_grammatical_inference
http://www.intechopen.com/articles/show/title/an_extension_of_finite-state_markov_decision_process_and_an_application_of_grammatical_inference