Thin Paths
Download Thin Paths PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Thin Paths book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Thin Paths
Shortlisted for the 2011 Costa Biography Award and the 2012 Royal Society of Literature Ondaatje Prize Julia Blackburn and her husband moved to a little house in the mountains of northern Italy in 1999. She arrived as a stranger but a series of events brought her close to the old people of the village and they began to tell her their stories. Of how their village had been trapped in an archaic feudal system and owned by a local padrone who demanded his share of all they had, of the eruption of the Second World War, of the conflict between the fascists and the partisans, of death and fear and hunger of how they hid like like foxes in the mountains. 'Write it down for us,' they said, 'because otherwise it will all be lost.' Thin Paths is a celebration of the songlines of one place that could be many places and a celebration of the humour and determination of the human spirit.
Combinatorial Optimization and Applications
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008. The 44 revised full papers were carefully reviewed and selected from 84 submissions. The papers feature original research in the areas of combinatorial optimization -- both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
Mathematical Foundations of Computer Science 2001
This book constitutes the refereed proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001, held in Marianske Lazne, Czech Republic in August 2001. The 51 revised full papers presented together with 10 invited contributions were carefully reviewed and selected from a total of 118 submissions. All current aspects of theoretical computer science are addressed ranging from mathematical logic and programming theory to algorithms, discrete mathematics, and complexity theory. Besides classical issues, modern topics like quantum computing are discussed as well.