Cargando…
Pairing Optimization via Statistics: Algebraic Structure in Pairing Problems and Its Application to Performance Enhancement
Fully pairing all elements of a set while attempting to maximize the total benefit is a combinatorically difficult problem. Such pairing problems naturally appear in various situations in science, technology, economics, and other fields. In our previous study, we proposed an efficient method to infe...
Autores principales: | Fujita, Naoki, Röhm, André, Mihana, Takatomo, Horisaki, Ryoichi, Li, Aohan, Hasegawa, Mikio, Naruse, Makoto |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9858184/ https://www.ncbi.nlm.nih.gov/pubmed/36673287 http://dx.doi.org/10.3390/e25010146 |
Ejemplares similares
-
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk
por: Yamagami, Tomoki, et al.
Publicado: (2023) -
Acceleration of Approximate Matrix Multiplications on GPUs
por: Okuyama, Takuya, et al.
Publicado: (2023) -
Scalable photonic reinforcement learning by time-division multiplexing of laser chaos
por: Naruse, Makoto, et al.
Publicado: (2018) -
Decision making for large-scale multi-armed bandit problems using bias control of chaotic temporal waveforms in semiconductor lasers
por: Morijiri, Kensei, et al.
Publicado: (2022) -
Asymmetric quantum decision-making
por: Shiratori, Honoka, et al.
Publicado: (2023)