Kategoria BISAC: Computers >> Programming - Algorithms

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

This hands-on textbook/reference presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Each chapter opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of...

This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The book characterizes those algebras for which SysPolSat can be solved in a polynomial time. So far, studies and their outcomes have not covered algebras that generate a variety admitting type 1 in the sense of Tame Congruence Theory. Since unary algebras admit only type 1, this book focuses on these...

This book constitutes the proceedings of the 10th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2015, held in Qufu, Shandong, China, in August 2015.

The 36 revised full papers presented together with 5 revised short papers and 42 invited papers were carefully reviewed and selected from 133 initial submissions. The papers present current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include effective and efficient state-of-the-art algorithm design and analysis, reliable and...

When you write software, you need to be at the top of your game. Great programmers practice to keep their skills sharp. Get sharp and stay sharp with more than fifty practice exercises rooted in real-world scenarios. If you're a new programmer, these challenges will help you learn what you need to break into the field, and if you're a seasoned pro, you can use these exercises to learn that hot new language for your next gig.

One of the best ways to learn a programming language is to use it to solve problems. That's what this book is all about. Instead of questions rooted in theory,...

This book is about the (min, +) algebra and its application to worst-case performances in networks, the network calculus theory. Mastering worst-case delays and memory usage in networks is a quality in soft real-time systems (like the one on the Internet: audio, video, etc.) and a requirement for critical real-time systems (like the cyber-physical ones: aircrafts, factories, etc.). The network calculus theory has been designed, implemented and used to compute such bounds. This book offers an up-to-date overview of this framework, from its mathematical background (the min-plus algebra) to...

Das an Studienanfanger der Mathematik gerichtete Lehrbuch bietet eine breit angelegte Einfuhrung in verschiedene Facetten der computerorientierten Mathematik. Es ermoglicht eine fruhzeitige und wertvolle Auseinandersetzung mit computerorientierten Methoden, Denkweisen und Arbeitstechniken innerhalb der Mathematik.

Hierzu werden grundlegende mathematische Teilgebiete behandelt, die eine enge Beziehung zu computerorientierten Aspekten haben: Graphen, mathematische Algorithmen, Rekursionsgleichungen, computerorientierte lineare Algebra, Zahlen, Polynome und ihre Nullstellen. Anhand des...

When encountering difficult concepts in computer programming for the first time, many students struggle to find simple explanations in their textbooks. Information can also be hard to find on common mistakes made when implementing algorithms and writing programs.

This concise and easy-to-follow textbook/guide provides a student-friendly introduction to programming and algorithms. Emphasis is placed on the threshold concepts that present barriers to learning, including the questions that students are often too embarrassed to ask. The book promotes an active learning style in...

This book constitutes the refereed proceedings of the 12th International Colloquium on Theoretical Aspects of Computing, ICTAC 2015, held in Cali, Colombia, in October 2015. The 25 revised full papers presented together with 7 invited talks, 3 tool papers, and 2 short papers were carefully reviewed and selected from 93 submissions. The papers cover various topics such as algebra and category theory; automata and formal languages; concurrency; constraints, logic and semantic; software architecture and component-based design; and verification.

This Festschrift volume is published in honor of Professor Paul G. Spirakis on the occasion of his 60^th birthday. It celebrates his significant contributions to computer science as an eminent, talented, and influential researcher and most visionary thought leader, with a great talent in inspiring and guiding young researchers.

The book is a reflection of his main research activities in the fields of algorithms, probability, networks, and games, and contains a biographical sketch as well as essays and research contributions from close collaborators and former PhD...

This book constitutes the proceedings of the 17^th International Workshop on Computer Algebra in Scientific Computing, CASC 2015, held in Aachen, Germany, in September 2015.

The 35 full papers presented in this volume were carefully reviewed and selected from 42 submissions. They deal with the ongoing progress both in theoretical computer algebra and its expanding applications. New and closer interactions are fostered by combining the area of computer algebra methods and systems and the application of the tools of computer algebra for the solution of problems in...

This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015.

The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 78 submissions. The papers focus on the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.

The master thesis of Susanne Gobel generates the deep understanding of the Mobile Ambient (MA) calculus that is necessary to use it as a modeling language. Instead of calculus terms a much more convenient representation via MA trees naturally maps to the application area of networks where processes pass hierarchical protection domains like firewalls. The work analyses MA's function principles and derives a translation into Safe Petri nets. It extends to arbitrary MA processes but finiteness of the net and therefore decidability of reachability is only guaranteed for bounded processes. The...

Evolutionary algorithms are bio-inspired algorithms based on Darwin's theory of evolution. They are expected to provide non-optimal but good quality solutions to problems whose resolution is impracticable by exact methods.

In six chapters, this book presents the essential knowledge required to efficiently implement evolutionary algorithms.

Chapter 1 describes a generic evolutionary algorithm as well as the basic operators that compose it. Chapter 2 is devoted to the solving of continuous optimization problems, without constraint. Three leading approaches are described and...

• Wanted to work at an exciting futuristic company?
• Struggled with an interview problem that could have been solved in 15 minutes?
• Wished you could study real-world computing problems?

If so, you need to read Elements of Programming Interviews (EPI).

EPI is your comprehensive guide to interviewing for software development roles.

The core of EPI is a collection...