K ERCIYES (35 Ergebnisse)

Zustand: New.

Zustand: New.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less.

Zustand: as new. Wie neu/Like new.

Paperback. Zustand: Brand New. 234 pages. 9.25x6.10x0.47 inches. In Stock.

Softcover. Zustand: Very Good. 1. Auflage. unread, cover with shelfwear or minor damages.

Softcover. Zustand: Very Good. 1. Auflage. Unread, some shelfwear. Immediately dispatched from Germany.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New.

Paperback. Zustand: Brand New. 352 pages. 9.25x6.10x1.18 inches. In Stock.

Zustand: New.

Zustand: New. 2021. 1st ed. 2021. Paperback. . . . . . Books ship from the US and Ireland.

Paperback. Zustand: Brand New. 360 pages. 9.25x6.10x0.82 inches. In Stock.

Zustand: New.

Hardcover. Zustand: Brand New. 388 pages. 9.50x6.50x1.25 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode, together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 236 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula.The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices.Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory.The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode,together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms.

Taschenbuch. Zustand: Neu. Neuware -This classroom-tested textbook describes the design and implementation of software for distributed real-time systems, using a bottom-up approach. The text addresses common challenges faced in software projects involving real-time systems, and presents a novel method for simply and effectively performing all of the software engineering steps. Each chapter opens with a discussion of the core concepts, together with a review of the relevant methods and available software. This is then followed with a description of the implementation of the concepts in a sample kernel, complete with executable code.Topics and features: introduces the fundamentals of real-time systems, including real-time architecture and distributed real-time systems; presents a focus on the real-time operating system, covering the concepts of task, memory, and input/output management; provides a detailed step-by-step construction of a real-time operating system kernel, which is then used to test various higher level implementations; describes periodic and aperiodic scheduling, resource management, and distributed scheduling; reviews the process of application design from high-level design methods to low-level details of design and implementation; surveys real-time programming languages and fault tolerance techniques; includes end-of-chapter review questions, extensive C code, numerous examples, and a case study implementing the methods in real-world applications; supplies additional material at an associated website.Requiring only a basic background in computer architecture and operating systems, this practically-oriented work is an invaluable study aid for senior undergraduate and graduate-level students of electrical and computer engineering, and computer science. The text will also serve as a useful general reference for researchers interested in real-time systems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 360 pp. Englisch.

Taschenbuch. Zustand: Neu. Neuware -This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed graph algorithms ¿ including algorithms for big data ¿ and an investigation into the conversion principles between the three algorithmic methods.Topics and features: presents a comprehensive analysis of sequential graph algorithms; offers a unifying view by examining the same graph problem from each of the three paradigms of sequential, parallel and distributed algorithms; describes methods for the conversion between sequential, parallel and distributed graph algorithms; surveys methods for the analysis of large graphs and complex network applications; includes full implementation details for the problems presented throughout the text; provides additional supporting material at an accompanying website.This practical guide to the design and analysis of graph algorithms is ideal for advanced and graduate students of computer science, electrical and electronic engineering, and bioinformatics. The material covered will also be of value to any researcher familiar with the basics of discrete mathematics, graph theory and algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 492 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This classroom-tested textbook describes the design and implementation of software for distributed real-time systems, using a bottom-up approach. The text addresses common challenges faced in software projects involving real-time systems, and presents a novel method for simply and effectively performing all of the software engineering steps. Each chapter opens with a discussion of the core concepts, together with a review of the relevant methods and available software. This is then followed with a description of the implementation of the concepts in a sample kernel, complete with executable code.Topics and features: introduces the fundamentals of real-time systems, including real-time architecture and distributed real-time systems; presents a focus on the real-time operating system, covering the concepts of task, memory, and input/output management; provides a detailed step-by-step construction of a real-time operating system kernel, which is then used to test various higher level implementations; describes periodic and aperiodic scheduling, resource management, and distributed scheduling; reviews the process of application design from high-level design methods to low-level details of design and implementation; surveys real-time programming languages and fault tolerance techniques; includes end-of-chapter review questions, extensive C code, numerous examples, and a case study implementing the methods in real-world applications; supplies additional material at an associated website.Requiring only a basic background in computer architecture and operating systems, this practically-oriented work is an invaluable study aid for senior undergraduate and graduate-level students of electrical and computer engineering, and computer science. The text will also serve as a useful general reference for researchers interested in real-time systems.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed graph algorithms - including algorithms for big data - and an investigation into the conversion principles between the three algorithmic methods.Topics and features: presents a comprehensive analysis of sequential graph algorithms; offers a unifying view by examining the same graph problem from each of the three paradigms of sequential, parallel and distributed algorithms; describes methods for the conversion between sequential, parallel and distributed graph algorithms; surveys methods for the analysis of large graphs and complex network applications; includes full implementation details for the problems presented throughout the text; provides additional supporting material at an accompanying website.This practical guide to the design and analysis of graph algorithms is ideal for advanced and graduate students of computer science, electrical and electronic engineering, and bioinformatics. The material covered will also be of value to any researcher familiar with the basics of discrete mathematics, graph theory and algorithms.

Paperback. Zustand: Brand New. reprint edition. 388 pages. 9.25x6.10x0.88 inches. In Stock.

Taschenbuch. Zustand: Neu. Guide to Graph Algorithms | Sequential, Parallel and Distributed | K. Erciyes | Taschenbuch | xviii | Englisch | 2019 | Springer Nature Switzerland | EAN 9783030103385 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Zustand: Brand New. reprint edition. 492 pages. 9.25x6.10x1.11 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The study of distributed algorithms provides the needed background in many real-life applications, such as: distributed real-time systems, wireless sensor networks, mobile ad hoc networks and distributed databases.The main goal of Guide to Distributed Algorithms is to provide a detailed study of the design and analysis methods of distributed algorithms and to supply the implementations of most of the presented algorithms in Python language, which is the unique feature of the book not found in any other contemporary books on distributed computing.Topics and features:Presents comprehensive design methods for distributed algorithmsProvides detailed analysis for the algorithms presentedUses graph templates to demonstrate the working of algorithmsProvides working Python code for most of the algorithms presentedThis unique textbook/study manual can serve as a comprehensive manual of distributed algorithms for Computer Science and non-CS majors as well as practitioners of distributed algorithms in research projects.

Hardcover. Zustand: Brand New. 360 pages. 9.25x6.10x1.10 inches. In Stock.

Zustand: New.