IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 189  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
SS, IPSJ-SE, KBSE [detail] 2022-07-30
10:30
Hokkaido Hokkaido-Jichiro-Kaikan (Sapporo)
(Primary: On-site, Secondary: Online)
The Use of Review Effort Objective for Search-based Refactoring Recommendation
Lei Chen, Shinpei Hayashi (Tokyo Tech) SS2022-18 KBSE2022-28
Search-based refactoring is to search for a sequence of refactorings that achieves a specific objective. Although a typi... [more] SS2022-18 KBSE2022-28
pp.103-108
CQ, CBE
(Joint)
2022-01-27
16:55
Ishikawa Kanazawa(Ishikawa Pref.)
(Primary: On-site, Secondary: Online)
An experimental study to clarify the characteristics of multiple random walks with different transition probabilities
Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-85
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] CQ2021-85
pp.50-55
CQ, CBE
(Joint)
2022-01-28
11:45
Ishikawa Kanazawa(Ishikawa Pref.)
(Primary: On-site, Secondary: Online)
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks
Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) CQ2021-92
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] CQ2021-92
pp.88-93
SRW, SeMI, CNR
(Joint)
2021-11-25
11:45
Tokyo Kikai-Shinko-Kaikan Bldg.
(Primary: On-site, Secondary: Online)
A Disaster Victim Search and Rescue System Using a Drone Network with Multiple Sensors
Naoki Takahashi, Masami Yoshida (Ritsumeikan Univ.), Alberto Gallegos Ramonet (Tokushima Univ.), Taku Noguchi (Ritsumeikan Univ.) SeMI2021-32
In general, the disaster victims closer to the center of the disaster are required to the more urgent rescue. The surviv... [more] SeMI2021-32
pp.13-18
R, LQE, OPE, CPM, EMD 2021-08-27
14:40
Online Online (Zoom) A design of highly fabrication-tolerant 2-µm 4-mode waveguide crossing based on mosaic structure
Taichi Muratsubaki, Takeshi Fujisawa, Yusuke Sawada, Takanori Sato, Kunimasa Saitoh (Hokkaido Univ.) R2021-26 EMD2021-7 CPM2021-16 OPE2021-27 LQE2021-6
A novel direct binary search algorithm for designing high-fabrication-tolerance mosaic-based devices is proposed, and wi... [more] R2021-26 EMD2021-7 CPM2021-16 OPE2021-27 LQE2021-6
pp.25-30
BioX, ISEC, SITE, ICSS, EMM, HWS, IPSJ-CSEC, IPSJ-SPT [detail] 2021-07-19
15:25
Online Online [Invited Talk] Data science practice from a legal and ethical perspective -- A case study of an avatar community application --
Soichiro Morishita (CA) ISEC2021-19 SITE2021-13 BioX2021-20 HWS2021-19 ICSS2021-24 EMM2021-24
In social networking services, messages may be monitored before and after with valid consent obtained from the user in o... [more] ISEC2021-19 SITE2021-13 BioX2021-20 HWS2021-19 ICSS2021-24 EMM2021-24
pp.56-59
R 2021-07-17
14:25
Online Virtual Refined Ensemble Learning Algorithms for Software Bug Prediction -- Metaheuristic Approach --
Keisuke Fukuda, Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2021-19
In this paper, we propose to apply three metaheuristic algorithms; latin hypercube sampling, ABC (artificial
bee colon... [more]
R2021-19
pp.18-23
RCS, SR, NS, SeMI, RCC
(Joint)
2021-07-15
10:55
Online Online Consensus Transmit Power Control with Optimal Search Technique for Full-duplex Wireless Multihop Networks
Khun Aung Thura Phyo, Lim Yuto, Tan Yasuo (JAIST) SeMI2021-20
Full-duplex (FD) communication is one of the key drivers for improving spectrum utilization. Many researches have been s... [more] SeMI2021-20
pp.39-44
CS, CQ
(Joint)
2021-05-14
10:50
Online On-line A Study of the Effect of Agents' Diversities on the Running Time of the Random Walk-Based Rendezvous Search
Fumiya Toyoda, Yusuke Sakumoto (Kwansei Univ.) CQ2021-13
A rendezvous search, which aims to efficiently meet multiple searchers existing different nodes on a network, is expecte... [more] CQ2021-13
pp.53-58
COMP 2021-03-08
15:15
Online Online A hyper-heuristic for the maximum clique problem
Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC) COMP2020-34
The maximum clique problem (MCP) is one of the most important combinatorial optimization problems that has many practica... [more] COMP2020-34
pp.30-37
COMP 2021-03-08
15:45
Online Online A further improved MCT algorithm for finding a maximum clique
Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35
We improve further the MCT algorithm for finding a maximum clique (FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] COMP2020-35
pp.38-45
ITS, IEE-ITS 2020-03-10
15:30
Shiga Ritsumeikan Univ. (BKC)
(Cancelled but technical report was issued)
On bicycle navigation system following traffic rules
Taichi Nawano, Tetsuya Manabe (Saitama Univ.) ITS2019-66
This paper proposes a bicycle navigation system following traffic rules in order to solve the problem of increasing bic... [more] ITS2019-66
pp.69-74
HWS, VLD [detail] 2020-03-06
13:50
Okinawa Okinawa Ken Seinen Kaikan
(Cancelled but technical report was issued)
Design Space Search for Faster Fp256 Elliptic Curve Cryptography
Kento Ikeda (Tokyo Univ.), Makoto Ikeda (d.lab) VLD2019-130 HWS2019-103
In this study, we created a scheduling of operations by changing parameters such as elliptic curves, their formulas, the... [more] VLD2019-130 HWS2019-103
pp.209-214
COMP 2019-09-02
16:00
Okayama Tsushima Campus, Okayama University Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams
Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16
This research proposes algorithms that construct compressed data
structures, called zero-suppressed binary decision dia... [more]
COMP2019-16
p.33
COMP, IPSJ-AL 2019-05-11
10:40
Kumamoto Kumamoto University Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams
Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$.
In this paper, when ... [more]
COMP2019-3
pp.51-58
WPT, AP
(Joint)
2019-01-18
10:50
Aichi Toyota Automobile Museum Performance Improvement of DOA Estimation Using Two-step Search Method Based on Compressed Sensing
Toshiya Nasu, Nobuyoshi Kikuma, Kunio Sakakibara (NITech) AP2018-160
In recent years, researches for applying signal-processing techniques based on sparse reconstruction andcompressed sensi... [more] AP2018-160
pp.51-56
CQ, CBE
(Joint)
2019-01-18
10:45
Tokyo Tokyo Metropolitan Univ. Clustering Protocol in Wireless Sensor Networks Using Cuckoo Search and Fuzzy Algorithm
Chiharu Ido, Yuji Sekiya (Tokyo Univ.) CQ2018-84
Wireless Sensor Networks (WSNs) is a network formed by a large number of sensor nodes where each node is equipped with a... [more] CQ2018-84
pp.47-52
COMP 2018-10-26
15:55
Kyoto Kyoto University [Invited Lecture] Report of Presentation in SEA2018 and Recent Study
Yu Nakahata, Jun Kawahara (NAIST) COMP2018-29
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is... [more] COMP2018-29
p.57
AI 2018-07-02
10:25
Hokkaido   Solving Constraint Satisfaction Problems Using Ant Colony Optimization with Multi-Pheromones
Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI2018-2
Ant colony optimization, ACO, is one of the meta-heuristics. ACO has been effective to solve constraint satisfaction pro... [more] AI2018-2
pp.7-10
DE 2018-06-22
13:45
Tokyo LIFULL Co., Ltd. Personalized Social Search Based on Agglomerative Hierarchical Graph Clustering
Kenkichi Ishizuka (DWANGO) DE2018-7
This paper describes a personalized social search algorithm for retrieving multimedia contents of a consumer generated m... [more] DE2018-7
pp.31-35
 Results 1 - 20 of 189  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan