1 option
On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) / Gail H. Godbeer, John Lipscomb, Michael Luby.
LIBRA Q336 .G33 1988
Available from offsite location
- Format:
- Book
- Author/Creator:
- Godbeer, Gail H.
- Series:
- Technical report (University of Toronto. Department of Computer Science) ; 208/88.
- Technical report ; 208/88
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Physical Description:
- 42, 34, 16 pages : illustrations ; 28 cm.
- Place of Publication:
- Toronto, Ont. : Department of Computer Science, University of Toronto, [1988]
- Contents:
- The computational complexity of the stable configuration problem for connectionist models / Gail H. Godbeer
- On the computational complexity of finding a connectionist model's stable state vectors / John Lipscomb.
- Notes:
- This report consists of two masters theses; one by Gail H. Godbeer and the other by John Lipscomb. Both were submitted in 1987 at the University of Toronto and supervised by Michael Luby.
- "March 1988."
- Includes bibliographical references.
- OCLC:
- 21936224
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.