|
|
All Technical Committee Conferences (Searched in: Recent 10 Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLC, IPSJ-NL |
2025-03-09 14:20 |
Nagasaki |
(Nagasaki, Online) (Primary: On-site, Secondary: Online) |
Algebraic Reproduction of Triage Decision Making Based on Heuristics of Boolean Multivalued Logic Hisashi Suzuki (Chuo Univ.), Atsushi Nishikawa (UOsaka) |
(To be available after the conference date) [more] |
|
IT |
2023-08-04 11:25 |
Kanagawa |
Shonan Institute of Technology (Kanagawa, Online) (Primary: On-site, Secondary: Online) |
Constructing Visual Cryptography Schemes for Multiple Images Using SAT Technology Tako Hiroaki (Univ. Yamanashi), Xiao-Nan Lu (Gifu Univ.), Nabeshima Hidetomo (Univ. Yamanashi) IT2023-25 |
The visual cryptography scheme (VCS) is a type of secret sharing scheme for images.The VCS uses matrices called basis ma... [more] |
IT2023-25 pp.62-67 |
COMP, IPSJ-AL |
2021-05-08 13:30 |
Online |
Online (Online) |
[Invited Talk]
Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shin-ichi Minato (Kyoto Univ.) COMP2021-8 |
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] |
COMP2021-8 p.54 |
NLP, CAS |
2019-10-22 09:15 |
Gifu |
Gifu Univ. (Gifu) |
Constraint Satisfaction Problem Solver by Hysteresis Neural Networks Takumi Genka, Kenya Jin'no (Tokyo City Univ.) CAS2019-24 NLP2019-64 |
Since solving Constraint Satisfaction Problems (CSPs) is very important, therefore, many solving methods are proposed. T... [more] |
CAS2019-24 NLP2019-64 pp.7-10 |
AI |
2018-07-02 10:25 |
Hokkaido |
(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 |
VLD, HWS (Joint) |
2018-02-28 11:00 |
Okinawa |
Okinawa Seinen Kaikan (Okinawa) |
A fast routing method for multi-terminal nets using constraint satisfaction problem Saki Yamaguchi, Yasuhiro Takashima (Univ. of Kitakyushu) VLD2017-92 |
In this paper, we propose a fast routing method using constraint satisfaction problem (CSP) for multi-terminal nets.
I... [more] |
VLD2017-92 pp.19-24 |
CS, NS, IN, NV (Joint) |
2017-09-08 11:15 |
Miyagi |
Research Institute of Electrical Communication, Tohoku Univ. (Miyagi) |
A Method for determining paths of low delay communication flows in industrial networks Makoto Kubomi, Takeshi Suehiro, Ryuma Matsushita, Yoshifumi Hotta, Ryusuke Kawate (Mitsubishi Electric) NS2017-83 |
Ethernet has been applied to industrial in-vehicle, train and factory networks due to its high capacity and cost effecti... [more] |
NS2017-83 pp.73-78 |
KBSE |
2016-05-27 10:00 |
Tokyo |
Doshisha Univ. Tokyo Branch Office (Tokyo) |
Reducing the number of mutants with equivalent bug detection ability Tomohiro Ueno, Hirohide Haga (Doshisha Univ.) KBSE2016-5 |
Mutation analysis is a method to evaluate the software test cases set quality. In mutation analysis, mutant programs are... [more] |
KBSE2016-5 pp.25-30 |
|
|
|
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]
|