Tags
Language
Tags
<<
April 2024
Su Mo Tu We Th Fr Sa
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 2 3 4
  1. Home
  2. eBooks & eLearning
  3. problem complexity

Abstract State Machines, Alloy, B, VDM, and Z

Posted By: AvaxGenius
Date: 25 Sep 2023 07:59:40
Abstract State Machines, Alloy, B, VDM, and Z

Abstract State Machines, Alloy, B, VDM, and Z: Third International Conference, ABZ 2012, Pisa, Italy, June 18-21, 2012. Proceedings by John Derrick, John Fitzgerald, Stefania Gnesi, Sarfraz Khurshid, Michael Leuschel, Steve Reeves, Elvinia Riccobene
English | PDF | 2012 | 392 Pages | ISBN : 3642308848 | 8.6 MB

This book constitutes the proceedings of the Third International Conference on Abstract State Machines, B, VDM, and Z, which took place in Pisa, Italy, in June 2012. The 20 full papers presented together with 2 invited talks and 13 short papers were carefully reviewed and selected from 59 submissions. The ABZ conference series is dedicated to the cross-fertilization of five related state-based and machine-based formal methods: Abstract State Machines (ASM), Alloy, B, VDM, and Z. They share a common conceptual foundation and are widely used in both academia and industry for the design and analysis of hardware and software systems. The main goal of this conference series is to contribute to the integration of these formal methods, clarifying their commonalities and differences to better understand how to combine different approaches for accomplishing the various tasks in modeling, experimental validation and mathematical verification of reliable high-quality hardware/software systems.
Details

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

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

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

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