|
|
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 # |
NLP |
2017-03-14 10:00 |
Aomori |
Nebuta Museum Warasse |
Search Capability of DPSO with Dynamically Varying Gain-Parameter Nobuaki Hashimoto, Masato Kaneko, Toshiya Iwai (Nihon Univ.) NLP2016-106 |
Discrete Particle Swarm Optimization(DPSO) is a metaheuristics that is improved to apply PSO to the discrete optimizatio... [more] |
NLP2016-106 pp.1-6 |
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 |
ISEC, IPSJ-CSEC, SITE, ICSS, EMM, IPSJ-SPT [detail] |
2011-07-13 09:50 |
Shizuoka |
Shizuoka University |
A Low Density Multiple Choice Knapsack Cryptosystem Akira Hayashi, Toshihiro Koike (KIT) ISEC2011-17 SITE2011-14 ICSS2011-22 EMM2011-16 |
The knapsack cryptosystem invented by Merkle and Hellman is known to be insecure against the low density attack by Lagar... [more] |
ISEC2011-17 SITE2011-14 ICSS2011-22 EMM2011-16 pp.91-96 |
SS |
2010-03-08 11:10 |
Kagoshima |
Kagoshima Univ. |
Research of Immune Algorithm for Multi-Objective Optimization Problems Ryota Morishige, Satoshi Ono, Shigeru Nakayama (Kagoshima Univ) SS2009-66 |
Over the past few years a considerable number of studies have been
made on multi-objective optimization in which more t... [more] |
SS2009-66 pp.109-114 |
ISEC |
2009-05-22 15:45 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Digital Signature Using Knapsack Problem Kunikatsu Kobayashi (Yamagata Univ.), Kotaro Honda (α systems) ISEC2009-12 |
We propose a digital signature using the knapsack problem. The security of this digital signature is based on the diffic... [more] |
ISEC2009-12 pp.77-80 |
COMP |
2005-10-19 09:35 |
Miyagi |
Tohoku Univ. |
Automated Competitive Analysis of Online Problems Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.) |
In this paper we study the 2-Bin Exchangeable Online Knapsack Problem (2EOK)
which is an extension of the 2-Bin Removab... [more] |
COMP2005-45 pp.7-12 |
|
|
|
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]
|