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

Neural computing approach to number theory problems

โœ Scribed by Anaikuppam R. Marudarajan; Harold Szu


Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
36 KB
Volume
1
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A neural network approach to tiling prob
โœ T. Tambouratzis ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 123 KB

The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has

Issues and problems in applying neural c
โœ Zahavi, Jacob ;Levin, Nissan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons โš– 88 KB ๐Ÿ‘ 1 views

Applying a neural network (NN) to the targeting and prediction problems in target marketing poses some unique problems and difficulties unparalleled in other business applications of neural computations. We discuss several of these issues in this article, as applied to solo mailings, offer remedies

Computational approaches to neural rewar
โœ Montague, P. Read ;Quartz, Steven R. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 327 KB ๐Ÿ‘ 2 views

Despite much progress in brain and cognitive sciences, attempts to connect brain function to cognition are hampered by the large explanatory gap between psychology and neurobiology. In recent years, a neurocomputational perspective has emerged as the most promising approach to integrating brain and

Neural network approach to the ECM probl
โœ Keniti Gonoi; Takakazu Kurokawa ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 128 KB ๐Ÿ‘ 2 views
Constrained neural approaches to quadrat
โœ S. Ishii; M. Sato ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 167 KB

In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP