Wyniki wyszukiwania:

This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com- puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer...

At age 13, Lanky is already six feet, four inches tall, and his adventures always seem to happen when he tries to help somebody in trouble, or when he gets a well-intentioned idea to make a bad situation better. And then ... wham Things go horribly wrong. But by using his clever, quirky, and often humorous way of looking at things, Lanky saves the day and all ends well. Lanky is adventurous, full of fun and eager for discovery. In this second volume, Lanky encounters a crooked traveling salesman conniving to cheat is customers at the annual Village Fair; helps a pair of lonely souls-two...

The idea for this book arose in 1993, after the Free State of Bavaria through its Bayrisches Staatsministerium rur Landesentwicklung und Umweltfragen (Bavarian Ministry of Regional Development and the Environment) decided to discontinue both the Bavarian project management (PBWU) for forest decline research and the multidisciplinary field research on the Wank Mountain in the Alps near Garmisch. Forest decline through the action of ozone and other photooxidants was a main topic of the supported re- search in the Alps and will be a topic of new investigations in the Bavarian Forest. Many...

This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer...