Presentation 1996/1/26
Maximum Neural Network Algorithms for N-Queen Problems
Yoichi Takenaka, Nobuo Funabiki, Seishi Nishikawa,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents maximum neural network algorithms for N-queen problems using the maximum neuron model. The maximum neuron model is proposed by Takefuji et al. in order to provide efficient neural network solutions for combinatorial optimization problems. In this model, one and only one neuron is always fired in each group of neurons, which can not only reduce the searching space drastically but also save the computation load. The simulation results show that the performance of our maximum neural network surpasses the existing neural network for the same problem. Particularly, the maximum neural network is shown to be much suitable for the semi-synchronous computation.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Neural network / N-queen problem / algorithm / maximum neuron model
Paper # COMP95-81
Date of Issue

Conference Information
Committee COMP
Conference Date 1996/1/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Maximum Neural Network Algorithms for N-Queen Problems
Sub Title (in English)
Keyword(1) Neural network
Keyword(2) N-queen problem
Keyword(3) algorithm
Keyword(4) maximum neuron model
1st Author's Name Yoichi Takenaka
1st Author's Affiliation Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University()
2nd Author's Name Nobuo Funabiki
2nd Author's Affiliation Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University
3rd Author's Name Seishi Nishikawa
3rd Author's Affiliation Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University
Date 1996/1/26
Paper # COMP95-81
Volume (vol) vol.95
Number (no) 498
Page pp.pp.-
#Pages 8
Date of Issue