Presentation	2003/7/7 A Searching Ability of Solutions of N-Queens Problem Using Chaotic Neural Networks Sinya FUKUDA, Kenya JIN'NO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In this study, we investigate a searching ability of the chaotic neural network. The N-Queens problem is one of combinatorial problems, and it can resolve easily. We utilize auto-correlation matrix by all solutions of the N-Queens problem as the connection coefficient matrix. We consider the output stream of the system.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	chaotic neural networks / Lyapunov exponent / combinatorial problem / associative memory / N-Queens problem
Paper #	NLP2003-43
Date of Issue

Conference Information
Committee	NLP
Conference Date	2003/7/7(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	Nonlinear Problems (NLP)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	A Searching Ability of Solutions of N-Queens Problem Using Chaotic Neural Networks
Sub Title (in English)
Keyword(1)	chaotic neural networks
Keyword(2)	Lyapunov exponent
Keyword(3)	combinatorial problem
Keyword(4)	associative memory
Keyword(5)	N-Queens problem
1st Author's Name	Sinya FUKUDA
1st Author's Affiliation	Electrical and Electronics Engineering, Nippon Institute of Technology()
2nd Author's Name	Kenya JIN'NO
2nd Author's Affiliation	Electrical and Electronics Engineering, Nippon Institute of Technology
Date	2003/7/7
Paper #	NLP2003-43
Volume (vol)	vol.103
Number (no)	185
Page	pp.pp.-
#Pages	6
Date of Issue