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

Competitive neural network to solve scheduling problems

โœ Scribed by Ruey-Maw Chen; Yueh-Min Huang

Book ID
114295750
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
339 KB
Volume
37
Category
Article
ISSN
0925-2312

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On problem solving with Hopfield neural
On problem solving with Hopfield neural networks
โœ Behzad Kamgar-Parsi; Behrooz Kamgar-Parsi ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 818 KB

Hop field and Tank have shown that neural networks can be used to solve certain computationally hard problems, in particular they studied the Traveling Salesman Problem (TSP). Based on network simulation results they conclude that analog VLSI neural nets can be promising in solving these problems. R

A neural network designed to solve the N
A neural network designed to solve the N-Queens Problem
โœ Jacek Mandziuk; Bohdan Macuk ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 451 KB

In this paper we discuss the Hopfield neural network designed to solve the N-Queens Problem (NQP). Our network exhibits good performance in escaping from local minima of energy surface of the problem. Only in approximately 1% of trials it settles in a false stable state (local minimum of energy). Ex