The Handbook of Painted Decoration
The Handbook of Painted Decoration

Author: Yannick Guégan

Publisher: W. W. Norton & Company

Published: 1996

Total Pages: 490

ISBN-13: 9780393730012

DOWNLOAD EBOOK

The essential reference for amateur and professional alike, The Handbook of Painted Decoration is the first book to cover the whole spectrum of trompe l'oeil decorative painting, from classic marbling and wood graining to ancient techniques of decorative painting that have been nearly forgotten.

Seeing Like a State
Seeing Like a State

Author: James C. Scott

Publisher: Yale University Press

Published: 2020-03-17

Total Pages: 462

ISBN-13: 0300252986

DOWNLOAD EBOOK

“One of the most profound and illuminating studies of this century to have been published in recent decades.”—John Gray, New York Times Book Review Hailed as “a magisterial critique of top-down social planning” by the New York Times, this essential work analyzes disasters from Russia to Tanzania to uncover why states so often fail—sometimes catastrophically—in grand efforts to engineer their society or their environment, and uncovers the conditions common to all such planning disasters. “Beautifully written, this book calls into sharp relief the nature of the world we now inhabit.”—New Yorker “A tour de force.”— Charles Tilly, Columbia University

Experimental and Efficient Algorithms
Experimental and Efficient Algorithms

Author: Celso C. Ribeiro

Publisher: Springer

Published: 2004-04-20

Total Pages: 595

ISBN-13: 3540248382

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the Third International Workshop on Experimental and Efficient Algorithms, WEA 2004, held in Angra dos Reis, Brazil in May 2004. The 40 revised full papers presented together with abstracts of two invited talks were carefully reviewed and selected from numerous submissions. The book is devoted to the areas of design, analysis, and experimental evaluation of algorithms. Among the topics covered are scheduling, heuristics, combinatorial optimization, evolutionary optimization, graph computations, labeling, robot navigation, shortest path algorithms, flow problems, searching, randomization and derandomization, string matching, graph coloring, networking, error detecting codes, timetabling, sorting, energy minimization, etc.