Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance an… mais…
Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation., Springer<
Springer.com
Nr. 978-0-7923-9528-7. Custos de envio:Worldwide free shipping, , DE. (EUR 0.00) Details...
(*) Livro esgotado significa que o livro não está disponível em qualquer uma das plataformas associadas buscamos.
Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance an… mais…
Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation., Springer<
Nr. 978-0-7923-9528-7. Custos de envio:Worldwide free shipping, , DE. (EUR 0.00)
1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do item, de uma possível adesão à plataforma, de uma entrega direta pela plataforma ou através de um fornecedor terceirizado (Marketplace), etc., é possível que os custos de envio indicados pela terralivro não correspondam aos da plataforma ofertante.
Dados bibliográficos do melhor livro correspondente
Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation.
Dados detalhados do livro - Random Generation of Trees
EAN (ISBN-13): 9780792395287 ISBN (ISBN-10): 079239528X Livro de capa dura Ano de publicação: 1994 Editor/Editora: Springer 224 Páginas Peso: 0,438 kg Língua: eng/Englisch
Livro na base de dados desde 2007-10-27T17:00:58-02:00 (Sao Paulo) Página de detalhes modificada pela última vez em 2023-12-04T16:09:12-03:00 (Sao Paulo) Número ISBN/EAN: 079239528X
Número ISBN - Ortografia alternativa: 0-7923-9528-X, 978-0-7923-9528-7 Ortografia alternativa e termos de pesquisa relacionados: Autor do livro: schott, rene laurent Título do livro: random generation trees random generators computer science, schott
Dados da editora
Autor: Laurent Alonso; René Schott Título: Random Generation of Trees - Random Generators in Computer Science Editora: Springer; Springer US 208 Páginas Ano de publicação: 1994-12-31 New York; NY; US Língua: Inglês 213,99 € (DE) 219,99 € (AT) 236,00 CHF (CH) Available XII, 208 p.
BB; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Notation; Probability theory; algorithms; code; combinatorics; complexity; Theory of Computation; Discrete Mathematics; Probability Theory; Diskrete Mathematik; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; BC; EA
1 Introduction.- 2 Notations.- 3 Generation of Simple Kinds of Trees.- 4 Generation Using Bijective Methods.- 5 Generation of Forests of Trees Split into Patterns.- 6 Generation of Colored Trees.- 7 Two Methods of Generation by Rejection.- 8 Arborescences.- 9 Generation of Trees with a Given Height and Some Tricks about Complexity.- 10 A Parallel Algorithm for the Generation of Words.- Appendix 1 Horton-Strahler’s Numbers.- Appendix 2 Algorithms.- 2.1 Generation of binary trees: Rimy’s algorithm.- 2.2 Generation of unary-binary trees: Samaj Lareida’s algorithm.- Appendix 3 Pictures of Trees.- References.
Outros livros adicionais, que poderiam ser muito similares com este livro:
