default search action
Ryoichi Horisaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i17]Shun Kotoku, Takatomo Mihana, André Röhm, Ryoichi Horisaki:
Decentralized multi-agent reinforcement learning algorithm using a cluster-synchronized laser network. CoRR abs/2407.09124 (2024) - 2023
- [j7]Hiroaki Shinkawa
, Nicolas Chauvet
Optimal Preference Satisfaction for Conflict-Free Joint Decisions. Complex. 2023: 2794839:1-2794839:19 (2023) - [j6]Naoki Fujita
Pairing Optimization via Statistics: Algebraic Structure in Pairing Problems and Its Application to Performance Enhancement. Entropy 25(1): 146 (2023) - [j5]Tomoki Yamagami
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk. Entropy 25(6): 843 (2023) - [i16]Kohei Tsuchiyama, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Makoto Naruse:
Effect of temporal resolution on the reproduction of chaotic dynamics via reservoir computing. CoRR abs/2302.10761 (2023) - [i15]Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk. CoRR abs/2304.10118 (2023) - [i14]Honoka Shiratori, Hiroaki Shinkawa, André Röhm, Nicolas Chauvet, Etsuo Segawa, Jonathan Laurent, Guillaume Bachelier, Tomoki Yamagami, Ryoichi Horisaki, Makoto Naruse:
Asymmetric quantum decision-making. CoRR abs/2305.02117 (2023) - [i13]Hisako Ito, Takatomo Mihana, Ryoichi Horisaki, Makoto Naruse:
Conflict-free joint decision by lag and zero-lag synchronization in laser network. CoRR abs/2307.15373 (2023) - [i12]Shun Kotoku, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Asymmetric leader-laggard cluster synchronization for collective decision-making with laser network. CoRR abs/2312.02537 (2023) - 2022
- [j4]Naoki Fujita
Efficient Pairing in Unknown Environments: Minimal Observations and TSP-Based Optimization. IEEE Access 10: 57630-57640 (2022) - [j3]Haruaki Tanaka
Experimental Demonstration of Delay-Bounded Wireless Network Based on Precise Time Synchronization. IEEE Access 10: 94285-94297 (2022) - [j2]Tomoki Yamagami
Directivity of Quantum Walk via Its Random Walk Replica. Complex. 2022: 9021583:1-9021583:14 (2022) - [i11]Naoki Fujita, Nicolas Chauvet, André Röhm, Ryoichi Horisaki, Aohan Li, Mikio Hasegawa, Makoto Naruse:
Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization. CoRR abs/2203.12214 (2022) - [i10]Hiroaki Shinkawa, Nicolas Chauvet, Guillaume Bachelier, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Optimal preference satisfaction for conflict-free joint decisions. CoRR abs/2205.00799 (2022) - [i9]Takashi Urushibara, Nicolas Chauvet, Satoshi Kochi, Satoshi Sunada, Kazutaka Kanno, Atsushi Uchida, Ryoichi Horisaki, Makoto Naruse:
Parallel bandit architecture based on laser chaos for reinforcement learning. CoRR abs/2205.09543 (2022) - [i8]Haruaki Tanaka, Yusuke Yamasaki, Satoshi Yasuda, Nobuyasu Shiga, Kenichi Takizawa, Nicolas Chauvet, Ryoichi Horisaki, Makoto Naruse:
Experimental Demonstration of Delay-Bounded Wireless Network Based on Precise Time Synchronization. CoRR abs/2207.00158 (2022) - [i7]Hiroaki Shinkawa, Nicolas Chauvet, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Guillaume Bachelier, Makoto Naruse:
Conflict-free joint sampling for preference satisfaction through quantum interference. CoRR abs/2208.03082 (2022) - [i6]Tomoki Yamagami, Etsuo Segawa, Ken'ichiro Tanaka, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse:
Skeleton structure inherent in discrete-time quantum walks. CoRR abs/2209.02943 (2022) - [i5]Naoki Fujita, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Aohan Li, Mikio Hasegawa, Makoto Naruse:
Pairing optimization via statistics: Algebraic structure in pairing problems and its application to performance enhancement. CoRR abs/2211.01661 (2022) - [i4]Hiroaki Shinkawa, Nicolas Chauvet, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Guillaume Bachelier, Makoto Naruse:
Bandit approach to conflict-free multi-agent Q-learning in view of photonic implementation. CoRR abs/2212.09926 (2022) - 2021
- [j1]Yusuke Yamasaki
Delay-Bounded Wireless Network Based on Precise Time Synchronization Using Wireless Two-Way Interferometry. IEEE Access 9: 85084-85100 (2021) - [i3]Takashi Amakasu, Nicolas Chauvet, Guillaume Bachelier, Serge Huant, Ryoichi Horisaki, Makoto Naruse:
Conflict-free collective stochastic decision making by orbital angular momentum entangled photons. CoRR abs/2107.00877 (2021) - [i2]Kazuharu Uchiyama, Sota Nakajima
Order recognition by Schubert polynomials generated by optical near-field statistics via nanometre-scale photochromism. CoRR abs/2111.09462 (2021) - 2020
- [c1]Mantaro Yamada, Hiroaki Adachi, Ryoichi Horisaki, Issei Sato:
A Comparison Of Compressed Sensing And Dnn Based Reconstruction For Ghost Motion Imaging. ICIP 2020: 2910-2914
2010 – 2019
- 2019
- [i1]Hiroaki Adachi, Yoko Kawamura, Keiji Nakagawa, Ryoichi Horisaki, Issei Sato, Satoko Yamaguchi, Katsuhito Fujiu, Kayo Waki, Hiroyuki Noji, Sadao Ota:
Use of Ghost Cytometry to Differentiate Cells with Similar Gross Morphologic Characteristics. CoRR abs/1903.09538 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: