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

- Tapa blanda
Librería: Bulrushed Books, Moscow, ID, Estados Unidos de AmericaBulrushed Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 16,95
Envío por EUR 8,15Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponible
Condición: 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.

- Tapa blanda
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 27,29
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

- Tapa blanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 26,04
Envío por EUR 3,94Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

- Tapa blanda
- Impresión bajo demanda
Librería: Forgotten Books, London, Reino UnidoForgotten Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 17,19
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Paperback. Condición: 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.…