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… Mehr…
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. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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… Mehr…
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. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
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.
Detailangaben zum Buch - Random Generation of Trees
EAN (ISBN-13): 9780792395287 ISBN (ISBN-10): 079239528X Gebundene Ausgabe Erscheinungsjahr: 1994 Herausgeber: Springer 224 Seiten Gewicht: 0,438 kg Sprache: eng/Englisch
Buch in der Datenbank seit 2007-10-27T21:00:58+02:00 (Berlin) Detailseite zuletzt geändert am 2023-12-04T20:09:12+01:00 (Berlin) ISBN/EAN: 9780792395287
ISBN - alternative Schreibweisen: 0-7923-9528-X, 978-0-7923-9528-7 Alternative Schreibweisen und verwandte Suchbegriffe: Autor des Buches: schott, rene laurent Titel des Buches: random generation trees random generators computer science, schott
Daten vom Verlag:
Autor/in: Laurent Alonso; René Schott Titel: Random Generation of Trees - Random Generators in Computer Science Verlag: Springer; Springer US 208 Seiten Erscheinungsjahr: 1994-12-31 New York; NY; US Sprache: Englisch 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.
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten: