Universal Routing Strategies for Interconnection Networks

Universal Routing Strategies for Interconnection Networks
Author: Christian Scheideler
Publisher: Springer
Total Pages: 248
Release: 2006-06-08
Genre: Computers
ISBN: 3540697926

This book presents the history and state of the art of universal routing strategies, which can be applied to networks independently of their respective topologies. It opens with a self-contained introduction, accessible also to newcomers. The main original results are new universal network protocols for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory.

Algorithms for Sensor and Ad Hoc Networks

Algorithms for Sensor and Ad Hoc Networks
Author: Dorothea Wagner
Publisher: Springer
Total Pages: 418
Release: 2007-09-27
Genre: Computers
ISBN: 3540749918

This monograph presents the outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in November 2005. It gives a first overview of algorithmic results on wireless ad hoc and sensor networks. Many chapters deal with distributed algorithms. Importance is attached to topics that combine both interesting aspects of wireless networks and attractive algorithmic methods. Each chapter provides a survey of some part of the field, while selected results are described in more detail.

Integer Programming and Combinatorial Optimization

Integer Programming and Combinatorial Optimization
Author: Oktay Günlük
Publisher: Springer Science & Business Media
Total Pages: 442
Release: 2011-05-10
Genre: Computers
ISBN: 3642208061

This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011. The 33 papers presented were carefully reviewed and selected from 110 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

High Performance Computing - HiPC 2001

High Performance Computing - HiPC 2001
Author: Burkhard Monien
Publisher: Springer Science & Business Media
Total Pages: 429
Release: 2001-12-05
Genre: Computers
ISBN: 3540430091

This book constitutes the refereed proceedings of the 8th International Conference on High Performance Computing, HiPC 2001, held in Hyderabad, India, in December 2001. The 29 revised full papers presented together with 5 keynote papers and 3 invited papers were carefully reviewed and selected from 108 submissions. The papers are organized in topical sections on algorithms, applications, architecture, systems software, communications networks, and challenges in networking.

Integer Programming and Combinatorial Optimization

Integer Programming and Combinatorial Optimization
Author: Michel Goemans
Publisher: Springer
Total Pages: 409
Release: 2013-03-12
Genre: Computers
ISBN: 3642366945

This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

LATIN 2002: Theoretical Informatics

LATIN 2002: Theoretical Informatics
Author: Sergio Rajsbaum
Publisher: Springer Science & Business Media
Total Pages: 643
Release: 2002
Genre: Computational complexity
ISBN: 3540434003

This book constitutes the refereed proceedings of the 5th International Symposium, Latin American Theoretical Informatics, LATIN 2002, held in Cancun, Mexico, in April 2002. The 44 revised full papers presented together with a tutorial and 7 abstracts of invited contributions were carefully reviewed and selected from a total of 104 submissions. The papers presented are devoted to a broad range of topics from theoretical computer science and mathematical foundations, with a certain focus on algorithmics and computations related to discrete structures.

Automata, Languages, and Programming

Automata, Languages, and Programming
Author: Magnús M. Halldórsson
Publisher: Springer
Total Pages: 1141
Release: 2015-06-19
Genre: Computers
ISBN: 366247672X

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata, and theory of programming; and foundations of networked computation: models, algorithms, and information management.

Algorithms -- ESA 2011

Algorithms -- ESA 2011
Author: Camil Demetrescu
Publisher: Springer Science & Business Media
Total Pages: 832
Release: 2011-09-06
Genre: Computers
ISBN: 3642237185

This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.