Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ICTSSL |
2024-05-16 14:45 |
Tokyo |
NEXCO-EAST ENGINEERING (Primary: On-site, Secondary: Online) |
On Some results on extended distance coloring of graphs Hiroshi Tamura (Chuo Univ.), Kazuyuki Miyakita, Keisuke Nakano (Niigata Univ.) |
(To be available after the conference date) [more] |
|
COMP, IPSJ-AL |
2024-05-09 11:05 |
Kyoto |
Kyoto University (Rakuyu-kaikan) |
Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models Takashi Horiyama, Yasuaki Kobayashi (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Kazuhisa Seto, Ryu Suzuki (Hokkaido Univ.) |
[more] |
|
ICM |
2024-03-22 15:05 |
Okinawa |
Okinawa Prefectural Museum and Art Museum (Primary: On-site, Secondary: Online) |
An integrated analysis on safety and security for an access point selection system in heterogeneous wireless network services Riku Murata, Norihiko Shinomiya (Soka Univ.) ICM2023-61 |
The proliferation of mobile terminals and the increase in the amount of data traffic can make it difficult for users to ... [more] |
ICM2023-61 pp.83-88 |
ICTSSL, CAS |
2024-01-26 11:50 |
Kanagawa |
(Primary: On-site, Secondary: Online) |
On extension of distance coloring of graphs and the number of colors Hiroshi Tamura (Chuo Univ.), Kazuyuki Miyakita, Kazuyuki Miyakita (Niigata Univ.) CAS2023-102 ICTSSL2023-55 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
CAS2023-102 ICTSSL2023-55 pp.97-100 |
SIP, IT, RCS |
2024-01-18 09:30 |
Miyagi |
(Primary: On-site, Secondary: Online) |
The quantum decoding attaining the minimum guesswork with single-qubit side information Michele Dall'Arno (TUT) IT2023-36 SIP2023-69 RCS2023-211 |
The minimum guesswork quantifies the minimum number of queries needed to guess the value of a random variable, when only... [more] |
IT2023-36 SIP2023-69 RCS2023-211 pp.37-38 |
COMP |
2023-10-24 14:05 |
Aichi |
Nagoya Univ. Venture Business Lab. |
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono, Kosuke Sugiyama (Nagoya Univ.) COMP2023-12 |
For an undirected graph $G=(V,E)$ and a $k$-nonnegative integer vector $bp=(p_1,ldots,p_k)$, a mapping $lcolon Vto mathb... [more] |
COMP2023-12 pp.9-11 |
RCS |
2023-10-19 16:15 |
Kagawa |
Kagawa University (Saiwai-cho Campus), and online (Primary: On-site, Secondary: Online) |
Channel assignment methods on wireless communication systems using multi-link operations Tomoyuki Yamada, Hirantha Abeysekera, Akira Kishida, Yusuke Asai, Yasushi Takatori (NTT) RCS2023-136 |
Multi-link operation (MLO) is a new feature proposed to be of the IEEE 802.11be Extremely High Throughput (EHT) amendmen... [more] |
RCS2023-136 pp.34-38 |
R |
2023-07-28 15:55 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Proposal for Obtaining Quisu-Optimal Arrangement of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of-(n_1,n_2,n_3):F system Tomoaki Akiba (CIT) R2023-17 |
In this study, we consider the component assignment problem of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of- (n_1,... [more] |
R2023-17 pp.39-44 |
CS |
2023-07-27 09:38 |
Tokyo |
Hachijo-machi Chamber of Commerce and Industry |
Proposal and Evaluation of Timed Bandwidth Control for Mobile Terminal Accommodation Ryo Murakami, Yuta Tachikawa, Yuki Hatanaka, Tetsuya Yokotani (KIT), Seiji Kozaki (Shizuoka University/MITSUBISHI ELECTRIC), Hiroshi Mineno (Shizuoka University), Takeshi Suehiro, Kenichi Nakura, Satoshi Shirai (MITSUBISHI ELECTRIC) CS2023-19 |
In the 5th Generation mobile network (5G), small cells will be deployed actively. Passive Optical Network (PON) technolo... [more] |
CS2023-19 pp.3-4 |
ICTSSL |
2023-07-28 10:25 |
Kumamoto |
(Primary: On-site, Secondary: Online) |
On extension of distance coloring of graphs Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2023-20 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
ICTSSL2023-20 pp.37-40 |
QIT (2nd) |
2023-05-29 16:30 |
Kyoto |
Katsura Campus, Kyoto University |
[Poster Presentation]
A parallel, branch and bound algorithm for a combinatorial instance of quantum hypothesis testing Baasanchimed Avirmed, Kaito Niinomi, Michele Dall'Arno (Toyohashi U. of Technology) |
[学生発表賞希望, application for student presentation award] We consider a particular instance of the quantum hypothesis testin... [more] |
|
R |
2023-05-27 15:25 |
Aichi |
Aichi University (Primary: On-site, Secondary: Online) |
Iterated local search for the component assignment problem of connected-(1,2)-or-(2,1)-out-of-(m,n):F lattice systems Taishin Nakamura (Tokai Univ.) R2023-5 |
In this study, we propose an Iterated Local Search (ILS) method for solving the component assignment problem of the conn... [more] |
R2023-5 pp.21-26 |
ICTSSL |
2023-05-19 11:15 |
Niigata |
(Primary: On-site, Secondary: Online) |
On the probability of coloring with the maximum number of colors in graphs Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2023-12 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
ICTSSL2023-12 pp.62-65 |
R |
2023-03-10 16:15 |
Hiroshima |
(Primary: On-site, Secondary: Online) |
Proposal for Obtaining Optimal Arrangement of the 3-dimensional-consecutive-(r1,r2,r3)-out-of-(n1,n2,n3):F system Tomoaki Akiba (Chiba IT) R2022-55 |
In this study, we consider the component assignment problem of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of- (n_1,... [more] |
R2022-55 pp.41-46 |
ICTSSL, CAS |
2023-01-26 12:50 |
Tokyo |
TBD (Primary: On-site, Secondary: Online) |
Channel assignment assuming call termination in wireless network and Grundy coloring of graphs Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) CAS2022-68 ICTSSL2022-32 |
he relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-know... [more] |
CAS2022-68 ICTSSL2022-32 pp.34-38 |
CAS, MSS, IPSJ-AL [detail] |
2022-11-18 09:30 |
Kochi |
(Primary: On-site, Secondary: Online) |
Maximum Number of Colors in Matching Coloring of Graphs and its Coloring Method Kanako Toyoda, Hiroshi Tamura (Chuo Univ.) CAS2022-47 MSS2022-30 |
The relationship between channel assignment in wireless communication and coloring problems in graph theory is well-know... [more] |
CAS2022-47 MSS2022-30 pp.51-54 |
PN |
2022-11-07 10:30 |
Kochi |
(Primary: On-site, Secondary: Online) |
Architecture and Planning of Fishbone SDM Submarine Optical Network Based on Core Selective Switch Kako Matsumoto, Kakeru Shintani, Masahiko Jinno (Kagawa Univ.) PN2022-22 |
Spatial division multiplexing (SDM) technologies such as multicore fiber (MCF) are expected to be first deployed in subm... [more] |
PN2022-22 pp.6-11 |
MIKA (3rd) |
2022-10-13 11:10 |
Niigata |
Niigata Citizens Plaza (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A study on high-speed channel assignment for dynamic NOMA system by laser chaos decision maker Aoi Matsuoka, Masaki Sugiyama (Tokyo University of Science), Aohan Li (The University of Electro-Communications), Makoto Naruse (The University of Tokyo), Mikio Hasegawa (Tokyo University of Science) |
Laser Chaos Decision Maker has been shown to enable ultra-fast and high-performance decision-making on the GHz order. Pr... [more] |
|
ICTSSL |
2022-07-29 14:45 |
Osaka |
Kansai University (Primary: On-site, Secondary: Online) |
On graph coloring considering co-channel interference and Grundy coloring of graphs Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2022-15 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] |
ICTSSL2022-15 pp.26-29 |
CQ, CS (Joint) |
2022-05-12 16:35 |
Fukui |
Fukui (Fuku Pref.) (Primary: On-site, Secondary: Online) |
Study on an Autonomous Adaptive Mechanism for Robustness of the User-Aware Resource Assignment against Demand Fluctuation Keita Tatebe, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-10 |
The assignment problem on networks is a fundamental problem associated with various methods such as distributed computin... [more] |
CQ2022-10 pp.50-55 |