๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Neural network computing for knight's tour problems

โœ Scribed by Yoshiyasu Takefuji; Kuo Chun Lee

Book ID
113399358
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
298 KB
Volume
4
Category
Article
ISSN
0925-2312

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for the Knight's
An efficient algorithm for the Knight's tour problem
โœ Ian Parberry ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

It is easy to see that there is no closed knight's tour when n is odd since such a board has one more white square than black, or vice versa, and since the colours of the squares visited on a knight's tour must alternate.

A neural network for signal decompositio
A neural network for signal decomposition problems
โœ Mauro Forti ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 673 KB

This paper presents the design of a neural network for signal decomposition problems with application examples. For this class of problems the proposed network has the same dynamics as the Hopfield net, but it is shown to realize the O ( M 2 ) connection paths among the M neurons with a number of wi