BORKAR, VIVEK S (38 Ergebnisse)

Gebundene Ausgabe. Zustand: Sehr gut. 216 Seiten; Zustand geprüft, Versand werktags innerhalb von 24 Stunden. Sehr gut erhalten ZA 9638201 Sprache: Englisch Gewicht in Gramm: 494.

Zustand: New.

Zustand: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher.

Zustand: New.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 156 | Sprache: Englisch | Produktart: Bücher.

Hardback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Zustand: New. In.

Broschiert. Zustand: Sehr gut. Pitman Research Notes in Mathematics Series. Zust: Gutes Exemplar. 179 Seiten, Englisch 346g.

Paperback. Zustand: Very Good. Paperback. Superficial marks and light scores on covers. Spine ends, front leading corner and lower edges are very lightly bumped. Light bump on spine body. Light creases on leading edges and front spine side. Front leading corners are very lightly creased, slightly bending pages within. Light score on page block face. Pages are clean and tight throughout. T. Used.

Taschenbuch. Zustand: Neu. Neuware -This book serves as an advanced text for a graduate course on stochastic algorithms for the students of probability and statistics, engineering, economics and machine learning. This second edition gives a comprehensive treatment of stochastic approximation algorithms based on the ordinary differential equation (ODE) approach which analyses the algorithm in terms of a limiting ODE. It has a streamlined treatment of the classical convergence analysis and includes several recent developments such as concentration bounds, avoidance of traps, stability tests, distributed and asynchronous schemes, multiple time scales, general noise models, etc., and a category-wise exposition of many important applications. It is also a useful reference for researchers and practitioners in the field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 292 pp. Englisch.

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.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling Salesman Problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies.The above innovative approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances.Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmicresults obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later and are illustrated with numerous examples.

Buch. Zustand: Neu. Neuware -This book serves as an advanced text for a graduate course on stochastic algorithms for the students of probability and statistics, engineering, economics and machine learning. This second edition gives a comprehensive treatment of stochastic approximation algorithms based on the ordinary differential equation (ODE) approach which analyses the algorithm in terms of a limiting ODE. It has a streamlined treatment of the classical convergence analysis and includes several recent developments such as concentration bounds, avoidance of traps, stability tests, distributed and asynchronous schemes, multiple time scales, general noise models, etc., and a category-wise exposition of many important applications. It is also a useful reference for researchers and practitioners in the field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 292 pp. Englisch.

Hindustan Book Agency, New Delhi 2008. ix, 164, (2) pp. Hardcover. Fine condition. (Text and Readings in Mathematics 48).