Efficient Pairing in Unknown Environments: Minimal Observations and TSP-Based Optimization
Generating paired sequences with maximal compatibility from a given set is one of the most important challenges in various applications, including information and communication technologies. However, the number of possible pairings explodes in a double factorial order as a function of the number of...
Main Authors: | Naoki Fujita, Nicolas Chauvet, Andre Rohm, Ryoichi Horisaki, Aohan Li, Mikio Hasegawa, Makoto Naruse |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9785571/ |
Similar Items
-
Pairing Optimization via Statistics: Algebraic Structure in Pairing Problems and Its Application to Performance Enhancement
by: Naoki Fujita, et al.
Published: (2023-01-01) -
An Improvement to the 2-Opt Heuristic Algorithm for Approximation of Optimal TSP Tour
by: Fakhar Uddin, et al.
Published: (2023-06-01) -
The retrace traveling salesman problem : a new extension of traveling salesman problem /
by: 212543 Juraidawati Arbain
Published: (2003) -
The retrace traveling salesman problem : a new extension of traveling salesman problem [compact disc] /
by: 212543 Juraidawati Arbain
Published: (2003) -
The retrace traveling salesman problem : a new extension of traveling salesman problem [microfilm] /
by: Juraidawati Arbain
Published: (2003)