All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $39.20Trending at AU $51.50
- AU $72.89Trending at AU $75.73
- AU $50.62Trending at AU $53.30
- AU $32.82Trending at AU $40.84
- AU $31.98Trending at AU $39.99
- AU $19.57Trending at AU $23.96
- AU $32.06Trending at AU $45.25
About this product
- DescriptionNeural Network Parallel Computing is the first book available to the professional market on neural network computing for optimization problems. This introductory book is t only for the vice reader, but for experts in a variety of areas including parallel computing, neural network computing, computer science, communications, graph theory, computer aided design for VLSI circuits, molecular biology, management science, and operations research. The goal of the book is to facilitate an understanding as to the uses of neural network models in real-world applications. Neural Network Parallel Computing presents a major breakthrough in science and a variety of engineering fields. The computational power of neural network computing is demonstrated by solving numerous problems such as N-queen, crossbar switch scheduling, four-coloring and k-colorability, graph planarization and channel routing, RNA secondary structure prediction, knight's tour, spare allocation, sorting and searching, and tiling. Neural Network Parallel Computing is an excellent reference for researchers in all areas covered by the book. Furthermore, the text may be used in a senior or graduate level course on the topic.
- Author(s)Yoshiyasu Takefuji
- PublisherSpringer-Verlag New York Inc.
- Date of Publication22/12/2012
- Series TitleThe Springer International Series in Engineering and Computer Science
- Series Part/Volume Number164
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Notebiography
- Weight402 g
- Width160 mm
- Height240 mm
- Spine13 mm
- Edition StatementSoftcover reprint of the original 1st ed. 1992
This item doesn't belong on this page.
Thanks, we'll look into this.