Kategoria BISAC: Computers >> Programming - Algorithms

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Conference on Finite Difference Methods, FDM 2014, held in Lozenetz, Bulgaria, in June 2014.

The 36 revised full papers were carefully reviewed and selected from 62 submissions. These papers together with 12 invited papers cover topics such as finite difference and combined finite difference methods as well as finite element methods and their various applications in physics, chemistry, biology and finance.

This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015.

The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs--with just enough math to let you understand and analyze algorithm performance.

With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific...

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.

The book...

This book constitutes the proceedings of the 25th International Conference on Automated Deduction, CADE-25, held in Berlin, Germany, in August 2015.

The 36 revised full papers presented ( 24 full papers and 12 system descriptions) were carefully reviewed and selected from 85 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations and practical experience.

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...

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...

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,...