giorgio ausiello (51 Ergebnisse)

Zustand: Good. 444 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Paperback. Zustand: Good. Zustand des Schutzumschlags: No Dust Jacket. Lecture Notes in Computer Science 372. Ex-Library. Front cover is creased on lower leading corner and front spine side. There is a scuff on the front cover resulting from possible sticker removal. Previous owner's sticker on the front cover. Small pen inscription on title page; library catalogue sticker on colophon. Faint bumps across some edges. Foot of page block a little yellowed due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Zustand: Fine. 554 pp., Hardcover, previous owner's name to front free endpaper, else fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Hardcover. Zustand: Good. Corrected. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.

Hardcover-Großformat. Zustand: Gut. XIX, 524 Seiten; In ENGLISCHER Sprache. Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). Sprache: Englisch Gewicht in Gramm: 1175.

Hardcover. Zustand: Good. 2013. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.

2. corrected print. 524 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9783540654315 Sprache: Englisch Gewicht in Gramm: 990.

Zustand: NEW.

Hardcover. Zustand: Very Good. 236 p. Buch.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Paperback. Zustand: Brand New. 200 pages. 3.94x3.94x2.36 inches. In Stock.

Paperback. Zustand: Brand New. 1981 edition. 224 pages. 9.61x6.69x0.47 inches. In Stock.

Paperback. Zustand: Brand New. 1984 edition. 248 pages. 9.61x6.69x0.71 inches. In Stock.

Zustand: Like New. Used - Like New. Book is new and unread but may have minor shelf wear. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Zustand: new.

Zustand: New.

Paperback. Zustand: Brand New. reprint edition. 272 pages. 9.30x6.20x0.64 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers.The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas ¿ such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences ¿ that show how algorithmic thinking offers practical solutions and also deepens domain knowledge.The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 272 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas- such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences- that show how algorithmic thinking offers practical solutions and also deepens domain knowledge.The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Logic programming and parallel complexity.- The generalized counting method for recursive logic queries.- Restructuring of complex objects and office forms.- Set containment inference.- A domain theoretic approach to higher-order relations.- On the desirability of -acyclic BCNF database schemes.- Update semantics under the domain closure assumption.- Unsolvable problems related to the view integration approach.- Horizontal decompositions based on functional-dependency-setimplications.- Update serializability in locking.- Filtering data flow in deductive databases.- Multidimensional order preserving linear hashing with partial expansions.- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers.- Towards online schedulers based on Pre-Analysis Locking.- Query processing in incomplete logical databases.- to the theory of nested transactions.- Entity-relationship consistency for relational schemas.- Modelling large bases of categorical data with acyclic schemes.- Some extensions to the closed world assumption in databases.- Expedient stochastic move-to-front and optimal stochastic move-to-rear list organizing strategies.- The cost of locking.- Theoretical foundation of algebraic optimization utilizing unnormalized relations.- A polynomial-time join dependency implication algorithm for unary multi-valued dependencies.- Interaction-free multivalued dependency sets.- Updating logical databases containing null values.- A new characterization of distributed deadlock in databases.

Gebunden. Zustand: New.

Zustand: New.

Buch. Zustand: Neu. Neuware -To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers.The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas ¿ such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences ¿ that show how algorithmic thinking offers practical solutions and also deepens domain knowledge.The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 272 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas- such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences- that show how algorithmic thinking offers practical solutions and also deepens domain knowledge.The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.

Hardcover. Zustand: Brand New. 200 pages. 3.94x3.94x2.36 inches. In Stock.

Hardcover. Zustand: Brand New. 290 pages. 9.25x6.25x0.75 inches. In Stock.

Paperback. Zustand: Brand New. reprint edition. 304 pages. 9.25x6.10x0.69 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 548 pp. Englisch.