Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3152121 obálek a 950676 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)
Rok: 2000
ISBN: 9781852333256
OKCZID: 110042899
Citace (dle ČSN ISO 690):
BUBLEY, Russ. Randomized algorithms: approximation, generation, and counting. London: Springer, c2001. xvi, 152 s. Distinguished dissertations.
Anotace
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.