|
|
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 # |
COMP |
2019-12-13 11:15 |
Gunma |
Ikaho Seminar House, Gunma University |
Computational complexity of satisfiability problem with exact number of solutions Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.) COMP2019-34 |
Valiant and Vazirani proved the isolation lemma for SAT to show a polynomial-time randomized reduction from SAT to Uniqu... [more] |
COMP2019-34 pp.39-43 |
PRMU, IPSJ-CVIM, IBISML [detail] |
2016-09-05 09:30 |
Toyama |
|
PRMU2016-55 IBISML2016-10 |
(To be available after the conference date) [more] |
PRMU2016-55 IBISML2016-10 pp.7-12 |
COMP |
2013-12-20 13:45 |
Okinawa |
Okinawa Industry Support Center |
A Power Allocation Management System Using an Algorithm for the Knapsack Problem Naoyuki Morimoto, Yuu Fujita, Masaaki Yoshida, Hiroyuki Yoshimizu, Masafumi Takiyamada, Terukazu Akehi, Masami Tanaka (Enegate) COMP2013-44 |
Power management for saving energy and reducing peak load can be viewed as the knapsack problem as follows; an appliance... [more] |
COMP2013-44 pp.39-43 |
COMP |
2007-09-20 15:50 |
Aichi |
|
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2007-39 |
The purpose of the online graph exploration problem is to visit all
the nodes of a given graph and come back to the sta... [more] |
COMP2007-39 pp.51-57 |
|
|
|
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]
|