Yves Robert

Alain Darte

A Graph-theoretic Approach to the Alignment Problem

Thierry Obrist

Thomas Stadelmann

Patrick Conrady

Pierre-Marie Glauser

Isabelle Homberger Gut

Ivo Gut

Valérie Humbert

Ralf Imstepf

Fabien Liégeois

Keita Mutombo

Valérie Paris

Alexandra Pillonel

Per Prod'hom

Annie Rochat Pauchard

Alexandre Sadik

Christine Sayegh

Cécilia Siegrist

Anne Tissot Benetto

Cédric Ballenegger

Sonja Bossart Meier

Thierry De Mitri

Damiano Mezzi

Valentina Moshek

Michael Beusch

Robert J. Danon

Dario Hug

Beat König

Simon Solms

Raphael Bagnoud

Charlotte Baumann

Gregory Clerc

Daniel de Vries Reilingh

Raphael Gani

Martin Kocher

Thierry Bornick

Lysandre Papadopoulos

Peter Spinnler

Liliane Subilia-Rouge

Plus d'une trentaine de contributions produites par les plumes de près de quarante auteurs se retrouvent dans ces Mélanges. Elles ont toutes en commun d'avoir été écrites en pensant à Pascal Mollard. Le carrefour c'est lui. Les sujets sont très variés, puisque beaucoup traitent – évidemment – de la taxe sur la valeur ajoutée, mais d'autres des impôts directs, de la fiscalité internationale, des conventions de double imposition, d'autres aussi de la procédure fiscale. Ces contributions sont le fait de praticiennes et de praticiens de la fiscalité : qu'ils défendent les contribuables, qu'ils représentent les autorités fiscales ou qu'ils siègent dans une Cour fiscale, leurs contributions apportent une pierre à l'édifice de la fiscalité directe et indirecte en Suisse.

Mélanges de droit fiscal en l'honneur de Monsieur le Juge Pascal Mollard

Au carrefour des contributions

Maurice Tchuente

Françoise Fogelman Soulié

Theory and Applications

Automata Networks in Computer Science

Frederic Vivien

Full of practical examples, Introduction to Scheduling presents the basic concepts and methods, fundamental results, and recent developments of scheduling theory. With contributions from highly respected experts, it provides self-contained, easy-to-follow, yet rigorous presentations of the material. The book first classifies scheduling problems and their complexity and then presents examples that demonstrate successful techniques for the design of efficient approximation algorithms. It also discusses classical problems, such as the famous makespan minimization problem, as well as more recent advances, such as energy-efficient scheduling algorithms. After focusing on job scheduling problems that encompass independent and possibly parallel jobs, the text moves on to a practical application of cyclic scheduling for the synthesis of embedded systems. It also proves that efficient schedules can be derived in the context of steady-state scheduling. Subsequent chapters discuss scheduling large and computer-intensive applications on parallel resources, illustrate different approaches of multi-objective scheduling, and show how to compare the performance of stochastic task-resource systems. The final chapter assesses the impact of platform models on scheduling techniques. From the basics to advanced topics and platform models, this volume provides a thorough introduction to the field. It reviews classical methods, explores more contemporary models, and shows how the techniques and algorithms are used in practice.

Introduction to Scheduling

Pierre Fraigniaud

Luc Bouge

Anne Mignotte

Content Description #Includes bibliographical references and index.

Second International Euro-Par Conference, Lyon, France, August 26-29, 1996. Proceedings

Euro-Par'96 - Parallel Processing

The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm

La Gloire de Mon Père

Anne Benoit

Frédéric Vivien

Presenting a complementary perspective to standard books on algorithms, A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis provides a roadmap for readers to determine the difficulty of an algorithmic problem by finding an optimal solution or proving complexity results. It gives a practical treatment of algorithmic complexity and guides readers in solving algorithmic problems. Divided into three parts, the book offers a comprehensive set of problems with solutions as well as in-depth case studies that demonstrate how to assess the complexity of a new problem. Part I helps readers understand the main design principles and design efficient algorithms. Part II covers polynomial reductions from NP-complete problems and approaches that go beyond NP-completeness. Part III supplies readers with tools and techniques to evaluate problem complexity, including how to determine which instances are polynomial and which are NP-hard. Drawing on the authors’ classroom-tested material, this text takes readers step by step through the concepts and methods for analyzing algorithmic complexity. Through many problems and detailed examples, readers can investigate polynomial-time algorithms and NP-completeness and beyond.

Paradigms, Methods, and Complexity Analysis

A Guide to Algorithm Design

Rafael tem onze anos quando é atingido por um relâmpago que o deixa cego. Isto acontece no exacto momento em que vai beijar Clarisse, uma menina com quem nunca falou, da qual não sabe nada, excepto que é a mais bonita da escola. Apesar de não ter qualquer dano nos olhos, Rafael não recupera a visão e ao longo dos anos seguintes desenvolve uma fobia ao exterior que o faz levar uma vida de recluso. Afasta-se de tudo e todos, só Clarisse o visita assiduamente. A cumplicidade entre ambos cresce, floresce e a amizade transforma-se naturalmente em namoro. Na idade adulta, quando já vivem juntos, Rafael descobre que a mulher que cresceu com ele é uma impostora. Desvairado, foge de casa com uma única obsessão: reencontrar a verdadeira Clarisse que ele acredita ter-se transformado num relâmpago. Começa então a percorrer o país, perseguindo tempestades. Um romance sobre a esperança e o desencanto, a vida e a morte, o perdão e o amor. Uma narrativa forte e uma voz única que consegue encantar os leitores com a sobriedade da escrita e um certo toque de magia que perpassa toda a história.

Espero por Ti na Próxima Tempestade

Michel Cosnard

Patrice Quinton

Proceedings of the International Workshop on Parallel & Distributed Algorithms, Chateau de Bonas, Gers, France, 3-6 October, 1988

Parallel & Distributed Algorithms

Yves Robert

About

Books

Join the club