A Hopfield neural net and its composition to solve a class of integer programming

Tadashi Ae, Reiji Aibara, Keiji Agusa, Masafumi Yamashita

Research output: Contribution to journalConference article

Abstract

A special type of parallel processing machines is proposed. Its features are summarized as follows: (1) The fundamental operation is very fast because it is realized by analog computation. (2) The primitive machine including fundamentally analog computation is a k-state machine, whose operation is realized by the principle of Hopfield neural network. (3) The total system is constructed by the composition of primitive machines, and can solve a class of polynomially solvable integer programming, with relatively low-cost hardware.

Original languageEnglish
Pages (from-to)1609-1612
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume3
Publication statusPublished - Dec 1 1991
Event1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5) - Singapore, Singapore
Duration: Jun 11 1991Jun 14 1991

Fingerprint

Integer programming
hardware
Neural networks
Hopfield neural networks
Chemical analysis
cost
Hardware
Processing
Costs

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

A Hopfield neural net and its composition to solve a class of integer programming. / Ae, Tadashi; Aibara, Reiji; Agusa, Keiji; Yamashita, Masafumi.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 3, 01.12.1991, p. 1609-1612.

Research output: Contribution to journalConference article

Ae, Tadashi ; Aibara, Reiji ; Agusa, Keiji ; Yamashita, Masafumi. / A Hopfield neural net and its composition to solve a class of integer programming. In: Proceedings - IEEE International Symposium on Circuits and Systems. 1991 ; Vol. 3. pp. 1609-1612.
@article{251644c54e5d4c5d972d0227d9ea80a8,
title = "A Hopfield neural net and its composition to solve a class of integer programming",
abstract = "A special type of parallel processing machines is proposed. Its features are summarized as follows: (1) The fundamental operation is very fast because it is realized by analog computation. (2) The primitive machine including fundamentally analog computation is a k-state machine, whose operation is realized by the principle of Hopfield neural network. (3) The total system is constructed by the composition of primitive machines, and can solve a class of polynomially solvable integer programming, with relatively low-cost hardware.",
author = "Tadashi Ae and Reiji Aibara and Keiji Agusa and Masafumi Yamashita",
year = "1991",
month = "12",
day = "1",
language = "English",
volume = "3",
pages = "1609--1612",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A Hopfield neural net and its composition to solve a class of integer programming

AU - Ae, Tadashi

AU - Aibara, Reiji

AU - Agusa, Keiji

AU - Yamashita, Masafumi

PY - 1991/12/1

Y1 - 1991/12/1

N2 - A special type of parallel processing machines is proposed. Its features are summarized as follows: (1) The fundamental operation is very fast because it is realized by analog computation. (2) The primitive machine including fundamentally analog computation is a k-state machine, whose operation is realized by the principle of Hopfield neural network. (3) The total system is constructed by the composition of primitive machines, and can solve a class of polynomially solvable integer programming, with relatively low-cost hardware.

AB - A special type of parallel processing machines is proposed. Its features are summarized as follows: (1) The fundamental operation is very fast because it is realized by analog computation. (2) The primitive machine including fundamentally analog computation is a k-state machine, whose operation is realized by the principle of Hopfield neural network. (3) The total system is constructed by the composition of primitive machines, and can solve a class of polynomially solvable integer programming, with relatively low-cost hardware.

UR - http://www.scopus.com/inward/record.url?scp=0026370555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026370555&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0026370555

VL - 3

SP - 1609

EP - 1612

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -