|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
CPSY, IPSJ-ARC, IPSJ-HPC |
2023-12-06 10:30 |
Okinawa |
Okinawa Industry Support Center (Primary: On-site, Secondary: Online) |
Development of Genetic Algorithm for Grid Graph in Order/Degree Problem Kimura Hiroto, Yoshiko Hanada (Kansai Univ.), Masahiro Nakao, Keiji Yamamoto (R-CCS) CPSY2023-32 |
We propose a genetic algorithm for solving grid graph that is a kind of Order/Degree problems (ODP). Grid graph is an op... [more] |
CPSY2023-32 pp.31-35 |
ISEC, COMP |
2017-12-21 11:25 |
Kochi |
Eikokuji Campus, Kochi University of Technology |
O(n^{1/3})-space algorithm for the grid graph reachability problem Ryo Ashida, Kotaro Nakagawa (Tokyo Tech) ISEC2017-75 COMP2017-29 |
The directed graph reachability problem is a canonical complete problem for class NL.
The best known polynomial time al... [more] |
ISEC2017-75 COMP2017-29 pp.19-24 |
COMP |
2005-12-22 16:25 |
Tokushima |
The University of Tokushima |
Max-Stretch Reduction for Tree Spanners Kazuo Iwama (Kyoto Univ.), Andrzej Lingas (Lund Univ.), Masaki Okita (Kyoto Univ.) |
A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ whose
max-stretch is $t$, i.e., the distance between ... [more] |
COMP2005-56 pp.49-55 |
|
|
|
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]
|