Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
EUR 35,94
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 56,68
Quantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 60,28
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Langue: anglais
Edité par Springer-Verlag New York Inc, 2008
ISBN 10 : 3540779175 ISBN 13 : 9783540779179
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 79,88
Quantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 2008 edition. 287 pages. 9.25x6.25x0.75 inches. In Stock.
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 53,49
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of elds. WAOA 2007 took place in Eilat, Israel, during October 11-12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.
Vendeur : preigu, Osnabrück, Allemagne
EUR 50,35
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Approximation and Online Algorithms | 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007, Revised Papers | Christos Kaklamanis (u. a.) | Taschenbuch | x | Englisch | 2008 | Springer | EAN 9783540779179 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Vendeur : Buchpark, Trebbin, Allemagne
EUR 43,31
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Sehr gut. Zustand: Sehr gut | Seiten: 304 | Sprache: Englisch | Produktart: Bücher | The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2007 took place in Eilat, Israel, during October 11¿12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.