Randomized Algorithms: Approximation, Generation, and Counting
Gebonden Engels 2000 9781852333256Niet leverbaar.
Samenvatting
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.
Specificaties
ISBN13:9781852333256
Taal:Engels
Bindwijze:Gebonden
Uitgever:Springer London
Hoofdrubriek:Programmeren, Computer en informatica
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
€ 96,94
Dit product is niet leverbaar
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan