✦ LIBER ✦

The loading problem for recursive neural networks

✍ Scribed by Marco Gori; Alessandro Sperduti

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 292 KB
Volume: 18
Category: Article
ISSN: 0893-6080
DOI: 10.1016/j.neunet.2005.07.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The recursive deterministic perceptron n

The recursive deterministic perceptron neural network

✍ Mohamed Tajine; David Elizondo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 307 KB

We introduce a feedforward multilayer neural network which is a generalization of the single layer perceptron topology (SLPT), called recursive deterministic perceptron (RDP). This new model is capable of solving any two-class classification problem, as opposed to the single layer perceptron which c

Use of recursive stochastic algorithm fo

Use of recursive stochastic algorithm for neural networks synthesis

✍ A.S. Poznyak; K. Najim; M. Chtourou 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 412 KB

On the complexity of loading shallow neu

On the complexity of loading shallow neural networks

✍ Stephen Judd 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 898 KB

We formalize a notion of loading information into connectionist networks that characterizes the training of feed-forward neural networks. This problem is NPcomplete, so we look for tractable subcases of the problem by placing constraints on the network architecture. The focus of these constraints is

Neural networks for constrained optimiza

Neural networks for constrained optimization problems

✍ Walter E. Lillo; Stefen Hui; Stanislaw H. Żak 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 592 KB

Neural networks for NP-complete problems

✍ Marco Budinich 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 547 KB

combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound ma

Using artificial neural networks for con

Using artificial neural networks for constraint satisfaction problem

✍ Ilié Popescu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 471 KB

We address the problem of solving a constraint satisfaction problem (CSP) by treating a constraint logic program (CLP) as a network of constraints. We attempt to show that each computation in a CLP becomes a sequence of linear steps, since the check satisfiability of the system of constraints is app