Based on a lecture course given at Chalmers University of Technology, this book is ideal for advanced undergraduate or beginning graduate students. The...
Lire la suite
40,70 €
Expédié sous 2 à 4 semaines
Livré chez vous entre le 11 mai et le 25 mai
En magasin
Résumé
Based on a lecture course given at Chalmers University of Technology, this book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recently developed Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding.