| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NLP, CCS | 2018-06-10 09:30 |
Kyoto | Kyoto Terrsa | Performance Analysis of a Coherent Ising Machine with Hardware Constraints Hirotake Ito, Yukio Murata (TUS), Hiroki Takesue (NTT), Kazuyuki Aihara (TU), Mikio Hasegawa (TUS)  NLP2018-39 CCS2018-12 |
A fast solution method of combinational optimization problem using a Coherent Ising Machine has been developed. A method... [more] | NLP2018-39 CCS2018-12 pp.63-68 |
| RECONF, CPSY, DC, IPSJ-ARC (Joint) [detail] |
2017-05-23 15:10 |
Hokkaido | Noboribetsu-Onsen Dai-ichi-Takimoto-Kan | CPSY2017-4 DC2017-4 RECONF2017-21 |
A CMOS Ising Computing based on Ising model, which effectively solves combinational optimization problems necessary for ... [more] | CPSY2017-4 DC2017-4 RECONF2017-21 pp.15-20(CPSY), pp.15-20(DC), pp.111-116(RECONF) |
| NLP | 2013-07-08 11:15 |
Okinawa | Miyako Island Marine Terminal | Basic performances in a discrete PSO with an intermittent refractoriness Yoshihiko Hayakawa, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2013-29 |
This paper proposes a discrete particle swarm optimization algorithm consisting of particles with an intermittent refr... [more] |
NLP2013-29 pp.15-19 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-27 09:00 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | A Method to Parallelize Simulated Annealing Algorithm by Generating Look-ahead Neighbor Solutions Yusuke Ota, Kazuhito Ito (Saitama Univ.) VLD2012-73 DC2012-39 |
Simulated annealing (SA) is a general method to solve combinational optimization problems. SA generates a neigh￢bor solu... [more] | VLD2012-73 DC2012-39 pp.81-86 |
| COMP | 2009-10-16 10:00 |
Miyagi | Tohoku University | On simultaneous optimal segmentation of digital objects Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) COMP2009-32 |
Motivated from the image segmentation problem, we consider the problem of finding the maximum weight region with a shape... [more] | COMP2009-32 pp.1-8 |
| COMP | 2009-06-29 13:30 |
Hokkaido | Hokkaido University | Algorithms for optimal segmentation of regions decomposable into basic shapes Ryosei Kasai, Jinhee Chun, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) COMP2009-21 |
We consider optimal segmentation problem of a shape decomposable into elementary shapes in $n \times n$ pixel grid. We... [more] |
COMP2009-21 pp.23-30 |
| AI, IPSJ-ICS, JSAI-KBS | 2009-03-04 11:50 |
Miyagi | Laforet Zao Resort & Spa | Solving Puzzle with Neural Network
-- Hopfield Network can Solve Sudoku -- Akihiro Ohtani, Satoshi Matsuda (Nihon Univ) AI2008-88 |
We show that Hopfield network can solve all the Sudoku puzzles we have attacked so far. Most of them are very difficult ... [more] | AI2008-88 pp.141-146 |
| ET | 2008-10-17 15:55 |
Okayama | A Proposal of An Optimal Assignment Algorithm for General Academic Tomoya Shoji, Hiroki Fujii, Kanako Uemura, Hiroki Kawano, Nobuo Funabiki, Toru Nakanishi (Okayama Univ.) ET2008-48 |
Currently, general academic subjects in Okayama University consist of four categories, namely, “main subjects”, “individ... [more] | ET2008-48 pp.51-56 |
|
| NS, ICM, CQ (Joint) |
2007-11-16 08:50 |
Fukuoka | Institute of System LSI Design Industry, Fukuoka | A Fiber Allocation Search Algorithm for a Demand Expansion Term of Optical Network Services Masaya Shibaki, Shunsuke Kanai, Tatsuru Kawano, Tsutomu Maruyama (NTT) TM2007-36 |
We develop an Operation Support System (OSS) for provide optical access networks (OANs) Service quickly. This Ops condit... [more] | TM2007-36 pp.13-18 |
| NC | 2007-06-15 13:00 |
Okinawa | OIST Seaside House | Solving Sudoku Puzzle with Hopfield Network Akihiro Ohtani, Satoshi Matsuda (Nichi Univ) NC2007-20 |
Based on the insight that all the intellectual activities of human beings are carried out as optimization process, we al... [more] | NC2007-20 pp.69-74 |
[Return to Top Page]