ISBN: 9781334016592 - automatic storage optimization (classic reprint) (4 Ergebnisse)

- Softcover
Anbieter: Bulrushed Books, Moscow, ID, USABulrushed Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Wie neu
EUR 16,94
EUR 8,15 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: Like New. In unused condition, may show some slight shelf wear, but otherwise unread. This title was digitally scanned from a rare, out of print edition, and will have some visual artifacts from that process.

- Softcover
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 27,28
Versand gratisVersand innerhalb von USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 26,04
EUR 3,94 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
- Print-on-Demand
Anbieter: Forgotten Books, London, Vereinigtes KönigreichForgotten Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 17,19
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Paperback. Zustand: New. Print on Demand. This book is a significant study on automatic storage optimization. Specifically, the author looks at storage optimization in relation to several NP-complete problems, aiming to demonstrate both the plausibility and practicality of the technique. The author surveys past work on overlay heuristics and presents a family of heuristics that he has implemented in SOCRATES (the Storage Optimization Code Reorganization And Transformation Experimental System) to study the amenability of typical programs to various storage optimization techniques. The author finds that the problem of data overlay has a number of similarities to the Shipbuilding Problem and the Graph Coloring problem and demonstrates that, for array conflict graphs, a result by Alan Hoffman can be used to establish an upper bound for the extended chromatic number. Researchers with interests in compiler design, graph theory, and computer science will find much of interest in this book. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…