Fast Sequential Monte Carlo Methods for Counting and Optimization

Reuven Y. Rubinstein

ISBN 10: 1118612264 / ISBN 13: 9781118612262

Published by John Wiley & Sons Inc, 2014

About this Item

This book presents the first comprehensive account of fast sequential Monte Carlo (SMC) methods for counting and optimization at an exceptionally accessible level. Written by authorities in the field, it places great emphasis on cross-entropy, minimum cross-entropy, splitting, and stochastic enumeration. Series: Wiley Series in Probability and Statistics. Num Pages: 208 pages, Illustrations. BIC Classification: PBKS; PBT. Category: (P) Professional & Vocational. Dimension: 167 x 242 x 16. Weight in Grams: 426. . 2013. 1st Edition. Hardcover. . . . .

Seller Inventory # V9781118612262

Bibliographic Details

• Title: Fast Sequential Monte Carlo Methods for Counting and Optimization
• Publisher: John Wiley & Sons Inc
• Publication Date: 2014
• Language: English
• ISBN 10: 1118612264
• ISBN 13: 9781118612262
• Binding: Hardcover
• Edition: 1st Edition
• Condition: New

About this title

Synopsis

A comprehensive account of the theory and application of Monte Carlo methods

Based on years of research in efficient Monte Carlo methods for estimation of rare-event probabilities, counting problems, and combinatorial optimization, Fast Sequential Monte Carlo Methods for Counting and Optimization is a complete illustration of fast sequential Monte Carlo techniques. The book provides an accessible overview of current work in the field of Monte Carlo methods, specifically sequential Monte Carlo techniques, for solving abstract counting and optimization problems.

Written by authorities in the field, the book places emphasis on cross-entropy, minimum cross-entropy, splitting, and stochastic enumeration. Focusing on the concepts and application of Monte Carlo techniques, Fast Sequential Monte Carlo Methods for Counting and Optimization includes:

• Detailed algorithms needed to practice solving real-world problems
• Numerous examples with Monte Carlo method produced solutions within the 1-2% limit of relative error
• A new generic sequential importance sampling algorithm alongside extensive numerical results
• An appendix focused on review material to provide additional background information

Fast Sequential Monte Carlo Methods for Counting and Optimization is an excellent resource for engineers, computer scientists, mathematicians, statisticians, and readers interested in efficient simulation techniques. The book is also useful for upper-undergraduate and graduate-level courses on Monte Carlo methods.

About the Author

REUVEN Y. RUBINSTEIN, DSC, was Professor Emeritus in the Faculty of Industrial Engineering and Management at Technion-Israel Institute of Technology. The author of over 100 articles and six books, Dr. Rubinstein was also the inventor of the popular score-function method in simulation analysis and generic cross-entropy methods for combinatorial optimization and counting.

AD RIDDER, PHD, is Associate Professor of Operations Research at Vrije Universiteit Amsterdam. His research interests include rare event simulation, applied probability problems, queuing models, and Monte Carlo methods.

RADISLAV VAISMANis the author of numerous journal articles, and his research interests include rare event simulation, randomized algorithms, and on-line planning.