Librería: Magus Books Seattle, Seattle, WA, Estados Unidos de America
EUR 54,53
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: VG. used hardcover copy in illustrated boards, no jacket, as issued. light shelfwear, corners perhaps slightly bumped. pages and binding are clean, straight and tight. there are no marks to the text or other serious flaws.
Publicado por Springer-Verlag Publishing, 2003
ISBN 10: 0387008942 ISBN 13: 9780387008943
Idioma: Inglés
Librería: Salish Sea Books, Bellingham, WA, Estados Unidos de America
EUR 102,18
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. 2. Very Good; Hardcover; Light wear to the covers; Unblemished textblock edges; The endpapers and all text pages are clean and unmarked; The binding is excellent with a straight spine; This book will be shipped in a sturdy cardboard box with foam padding; Medium Format (8.5" - 9.75" tall); Tan and yellow covers with title in yellow lettering; 2nd Edition; 2003, Springer-Verlag Publishing; 500 pages; "Stochastic Approximation and Recursive Algorithms and Applications (Stochastic Modelling and Applied Probability, 35)," by Harold Kushner & G. George Yin.
Librería: Toscana Books, AUSTIN, TX, Estados Unidos de America
EUR 159,52
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 201,33
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 231,11
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: moluna, Greven, Alemania
EUR 230,64
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. This book presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. This second edition is a thorough revision, although the main features and stru.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 205,06
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 205,32
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 305,15
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 2nd ed. edition. 474 pages. 8.82x6.06x1.42 inches. In Stock.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 288,27
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 298,90
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Publicado por Springer New York Jul 2003, 2003
ISBN 10: 0387008942 ISBN 13: 9780387008943
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 322,83
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - The basic stochastic approximation algorithms introduced by Robbins and MonroandbyKieferandWolfowitzintheearly1950shavebeenthesubject of an enormous literature, both theoretical and applied. This is due to the large number of applications and the interesting theoretical issues in the analysis of 'dynamically de ned' stochastic processes. The basic paradigm is a stochastic di erence equation such as = + Y , where takes n+1 n n n n its values in some Euclidean space, Y is a random variable, and the 'step n size' > 0 is small and might go to zero as n . In its simplest form, n is a parameter of a system, and the random vector Y is a function of n 'noise-corrupted' observations taken on the system when the parameter is set to . One recursively adjusts the parameter so that some goal is met n asymptotically. Thisbookisconcernedwiththequalitativeandasymptotic properties of such recursive algorithms in the diverse forms in which they arise in applications. There are analogous continuous time algorithms, but the conditions and proofs are generally very close to those for the discrete time case. The original work was motivated by the problem of nding a root of a continuous function g ( ), where the function is not known but the - perimenter is able to take 'noisy' measurements at any desired value of . Recursive methods for root nding are common in classical numerical analysis, and it is reasonable to expect that appropriate stochastic analogs would also perform well.
Librería: moluna, Greven, Alemania
EUR 180,07
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. This second edition is a thorough revision, although the main features and stru.