Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks

Author: Christian Scheideler

Publisher: Springer

Published: 2006-06-08

Total Pages: 248

ISBN-13: 3540697926

DOWNLOAD EBOOK

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.

Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization

Author: Oktay Günlük

Publisher: Springer Science & Business Media

Published: 2011-05-10

Total Pages: 442

ISBN-13: 3642208061

DOWNLOAD EBOOK

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.

Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization

Author: Michel Goemans

Publisher: Springer

Published: 2013-03-12

Total Pages: 409

ISBN-13: 3642366945

DOWNLOAD EBOOK

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.

Graphs and Algorithms in Communication Networks
Graphs and Algorithms in Communication Networks

Author: Arie Koster

Publisher: Springer Science & Business Media

Published: 2009-12-01

Total Pages: 442

ISBN-13: 3642022502

DOWNLOAD EBOOK

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.

Job Scheduling Strategies for Parallel Processing
Job Scheduling Strategies for Parallel Processing

Author: Dror G. Feitelson

Publisher: Springer Science & Business Media

Published: 1998-08-05

Total Pages: 276

ISBN-13: 9783540648253

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.

Distributed Computing and Networking
Distributed Computing and Networking

Author: Shrisha Rao

Publisher: Springer Science & Business Media

Published: 2008-02-06

Total Pages: 605

ISBN-13: 3540774432

DOWNLOAD EBOOK

This book constitutes the fully refereed proceedings of the 9th International Conference on Distributed Computing and Networking, ICDCN 2008 - formerly known as IWDC (International Workshop on Distributed Computing), held in Kolkata, India, in January 2008. The 30 revised full papers and 27 revised short papers presented together with 3 keynote talks and 1 invited lecture were carefully reviewed and selected from 185 submissions. The papers are organized in topical sections.

Algorithms -- ESA 2011
Algorithms -- ESA 2011

Author: Camil Demetrescu

Publisher: Springer Science & Business Media

Published: 2011-09-06

Total Pages: 832

ISBN-13: 3642237185

DOWNLOAD EBOOK

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.

LATIN 2002: Theoretical Informatics
LATIN 2002: Theoretical Informatics

Author: Sergio Rajsbaum

Publisher: Springer Science & Business Media

Published: 2002

Total Pages: 643

ISBN-13: 3540434003

DOWNLOAD EBOOK

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.