Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 54,82
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
EUR 57,15
Quantité disponible : 5 disponible(s)
Ajouter au panierPaperback or Softback. Etat : New. Code Recognition and Set Selection with Neural Networks. Book.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 63,19
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 60,16
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 56,82
Quantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 59,78
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 66,69
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 64,27
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : 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.
Langue: anglais
Edité par Springer Nature B.V. Nov 2011, 2011
ISBN 10 : 1461278368 ISBN 13 : 9781461278368
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 82,48
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 .
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
EUR 62,37
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 60,46
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 68,57
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.