Sprache: Englisch
Verlag: Birkhauser, Boston, MA, U.S.A., 1991
ISBN 10: 0817635858 ISBN 13: 9780817635855
Anbieter: Book Dispensary, Concord, ON, Kanada
Hardcover. Zustand: Very Good. VERY GOOD hardcover, no marks in text, tight square spine; bright and clean. Book.
Anbieter: BOOKWEST, Phoenix, AZ, USA
Erstausgabe
Hardcover. Zustand: New. 1st Edition. SHRINK-WRAPPED: US SELLER SHIPS FAST FROM USA.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Paperback or Softback. Zustand: New. Code Recognition and Set Selection with Neural Networks. Book.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 60,16
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 56,82
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 59,78
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 166.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 73,39
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 166.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 66,69
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. pp. 166.
EUR 64,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. KlappentextIn mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n.
Sprache: Englisch
Verlag: Springer Nature B.V. Nov 2011, 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - In mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n-dimensional version of a particular problem can be accomplished with, say, 2 n n steps or will inevitably require 2 steps. Such a bound, together with a physical limit on computational speed in a machine, could be used to establish a speed limit for a particular problem. But there is nothing in the theory of computational complexity which precludes the possibility of constructing analog devices that solve such problems faster. It is a general goal of neural network researchers to circumvent the inherent limits of serial computation. As an example of an n-dimensional problem, one might wish to order n distinct numbers between 0 and 1. One could simply write all n! ways to list the numbers and test each list for the increasing property. There are much more efficient ways to solve this problem; in fact, the number of steps required by the best sorting algorithm applied to this problem is proportional to n In n .
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 60,46
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 68,57
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.