Tags
Language
Tags
<<
November 2024
Su Mo Tu We Th Fr Sa
27 28 29 30 31 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
  1. Home
  2. eBooks & eLearning
  3. algorithm analysis

Notes on Introductory Combinatorics (Repost)

Posted By: AvaxGenius
Date: 7 Oct 2022 13:55:18
Notes on Introductory Combinatorics (Repost)

Notes on Introductory Combinatorics by George Pólya
English | PDF | 2010 | 202 Pages | ISBN : 0817631232 | 97.5 MB

Developed from the authors’ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths.
Details

Genetic Programming Theory and Practice III (Repost)

Posted By: AvaxGenius
Date: 1 Aug 2022 16:19:20
Genetic Programming Theory and Practice III (Repost)

Genetic Programming Theory and Practice III by Tina Yu, Rick Riolo, Bill Worzel
English | PDF | 2006 | 321 Pages | ISBN : 038728110X | 31.7 MB

Genetic Programming Theory and Practice III explores the emerging interaction between theory and practice in the cutting-edge, machine learning method of Genetic Programming (GP). This contributed volume was developed from the third workshop at the University of Michigan’s Center for the Study of Complex Systems to facilitate the exchange of ideas and information related to this rapidly advancing field. The text provides a cohesive view of the issues facing both practitioners and theoreticians and examines the synergy between GP theory and application.
Details

Polynomial Algorithms in Computer Algebra

Posted By: AvaxGenius
Date: 7 Jun 2022 07:18:03
Polynomial Algorithms in Computer Algebra

Polynomial Algorithms in Computer Algebra by Franz Winkler
English | PDF | 1996 | 283 Pages | ISBN : 3211827595 | 19.5 MB

For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it.
Details

Notes on Introductory Combinatorics

Posted By: AvaxGenius
Date: 26 Apr 2022 14:22:51
Notes on Introductory Combinatorics

Notes on Introductory Combinatorics by George Pólya
English | PDF | 2010 | 202 Pages | ISBN : 0817631232 | 97.5 MB

Developed from the authors’ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths.
Details

Handbook of Floating-Point Arithmetic

Posted By: AvaxGenius
Date: 24 Apr 2022 05:28:12
Handbook of Floating-Point Arithmetic

Handbook of Floating-Point Arithmetic by Jean-Michel Muller
English | PDF(True) | 2010 | 579 Pages | ISBN : 081764704X | 6.7 MB

Floating-point arithmetic is by far the most widely used way of implementing real-number arithmetic on modern computers. Although the basic principles of floating-point arithmetic can be explained in a short amount of time, making such an arithmetic reliable and portable, yet fast, is a very difficult task. From the 1960s to the early 1980s, many different arithmetics were developed, but their implementation varied widely from one machine to another, making it difficult for nonexperts to design, learn, and use the required algorithms. As a result, floating-point arithmetic is far from being exploited to its full potential.
Details

Algorithms and Data Structures: The Basic Toolbox

Posted By: AvaxGenius
Date: 8 Mar 2022 15:48:29
Algorithms and Data Structures: The Basic Toolbox

Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn
English | PDF(True) | 2008 | 305 Pages | ISBN : 3540779779 | 3.9 MB

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems.
Details

Bioinformatics: Problem Solving Paradigms

Posted By: AvaxGenius
Date: 8 Mar 2022 15:37:41
Bioinformatics: Problem Solving Paradigms

Bioinformatics: Problem Solving Paradigms by Volker Sperschneider
English | PDF(True) | 2009 | 302 Pages | ISBN : 3540785051 | 4 MB

There are fundamental principles for problem analysis and algorithm design that are continuously used in bioinformatics. This book concentrates on a clear presentation of these principles, presenting them in a self-contained, mathematically clear and precise manner, and illustrating them with lots of case studies from main fields of bioinformatics (e.g. sequencing and mapping, string storage and manipulation, pattern matching, alignment, gene identification, genome rearrangement, structure prediction, regulatory networks, pseudoknot detection).
Details

Transactions on Data Hiding and Multimedia Security III

Posted By: AvaxGenius
Date: 7 Mar 2022 22:13:15
Transactions on Data Hiding and Multimedia Security III

Transactions on Data Hiding and Multimedia Security III by Yun Q. Shi
English | PDF | 2008 | 99 Pages | ISBN : 3540690166 | 2.2 MB

Since the mid 1990s, data hiding has been proposed as an enabling technology for securing multimedia communication, and is now used in various applications including broadcast monitoring, movie fingerprinting, steganography, video indexing and retrieval, and image authentication.
Details

Hypercomputation: Computing Beyond the Church-Turing Barrier

Posted By: AvaxGenius
Date: 7 Mar 2022 06:06:18
Hypercomputation: Computing Beyond the Church-Turing Barrier

Hypercomputation: Computing Beyond the Church-Turing Barrier by Apostolos Syropoulos
English | PDF | 2008 | 253 Pages | ISBN : 0387308865 | 2.3 MB

Hypercomputation is a relatively new theory of computation which treats computing methods and devices that transcend the Church-Turing thesis. This book will provide a thorough description of the field of hypercomputation, covering all attempts at devising conceptual hypermachines and all new promising computational paradigms that may eventually lead to the construction of a hypermachine.
Details

Algorithmic Number Theory

Posted By: AvaxGenius
Date: 5 Mar 2022 17:22:12
Algorithmic Number Theory

Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings by Alfred J. van der Poorten
English | PDF | 2008 | 463 Pages | ISBN : 3540794557 | 7.9 MB

This book constitutes the refereed proceedings of the 8th International Algorithmic Number Theory Symposium, ANTS 2008, held in Banff, Canada, in May 2008.
Details

Sparse Grids and Applications - Stuttgart 2014

Posted By: AvaxGenius
Date: 3 Feb 2022 06:31:46
Sparse Grids and Applications - Stuttgart 2014

Sparse Grids and Applications - Stuttgart 2014 by Jochen Garcke
English | PDF | 2016 | 348 Pages | ISBN : 3319282603 | 5.3 MB

This volume of LNCSE is a collection of the papers from the proceedings of the third workshop on sparse grids and applications. Sparse grids are a popular approach for the numerical treatment of high-dimensional problems.
Details

Logic and Program Semantics: Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday

Posted By: AvaxGenius
Date: 11 Dec 2021 14:22:40
Logic and Program Semantics: Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday

Logic and Program Semantics: Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday by Robert L. Constable
English | PDF | 2012 | 366 Pages | ISBN : 3642294847 | 4.8 MB

This Festschrift volume is published in honor of Dexter Kozen on the occasion of his 60th birthday. Dexter Kozen has been a leader in the development of Kleene Algebras (KAs) and the contributions in this volume reflect the breadth of his work and influence.
Details

Abenteuer Informatik: IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media (Repost)

Posted By: AvaxGenius
Date: 10 Dec 2021 16:29:44
Abenteuer Informatik: IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media (Repost)

Abenteuer Informatik: IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media by Jens Gallenbacher
Deutsch | PDF | 2017 | 437 Pages | ISBN : 3662539640 | 160.5 MB

Informatik ist der Schlüssel, um unsere zunehmend digitalisierte Welt zu verstehen! In diesem Buch lesen Sie nicht nur, wie Navis den günstigsten Weg bestimmen, wie so viele Bilder auf eine kleine Speicherkarte passen oder welche Dinge ein Computer eben nicht ausrechnen kann. Mit Papier und Bleistift und den Bastelvorlagen können Sie die Antworten auf diese und viele weitere Fragen selbst buchstäblich begreifen. Ein Computer ist dafür nicht nötig!
Details

Distributed Graph Algorithms for Computer Networks

Posted By: AvaxGenius
Date: 10 Dec 2021 11:25:10
Distributed Graph Algorithms for Computer Networks

Distributed Graph Algorithms for Computer Networks by K. Erciyes
English | PDF,EPUB(Repost) | 2013 | 327 Pages | ISBN : 1447151720 | 7.2 MB

Graph theory is an invaluable tool for the designer of algorithms for distributed systems.
Details

Scheduling for Parallel Processing

Posted By: AvaxGenius
Date: 10 Dec 2021 11:08:42
Scheduling for Parallel Processing

Scheduling for Parallel Processing by Maciej Drozdowski
English | PDF | 2009 | 395 Pages | ISBN : 1848823096 | 7.2 MB

To take full advantage of high performance computing, parallel applications must be carefully managed to guarantee quality of service and fairness in using shared resources. Scheduling for parallel computing is an interdisciplinary subject joining many fields, and the broadness of research yields an immense number and diversity of models for understanding scheduling problems.
Details
UPWARDS