catherine goodrich (18 resultados)

Perfect Paperback. Condición: Very Good. Covers have very light edgewear with glossy surfaces. Pages have no highlighting or marks and show very light use.

Condición: New. pp. 56.

Condición: New. pp. 56.

Paperback. Condición: Brand New. 128 pages. 10.90x8.40x0.40 inches. In Stock.

Softcover. Seabury Books. xiii, 177 pp. Softcover. Very good condition; touches of wear on covers.

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: Fine. Estado de la sobrecubierta: Fine. 1st Edition. 1st ed., 1st printing ; 386 pages : illustrations, maps ; 24 cm OCLC 16094354 ISBN 9780531150603, 0531150607 Norma Goodrich's prowess as a scholar and historian proves conclusively that Merlin, the legendary wizard of King Arthur's court, was actually St. Dubricious, a talented scientist and magician and notorious ladies' man. ; Combines an array of evidence and argument drawn from years of dedicated scholarship and detective work to recover a great man of the Arthurian age ; Contents: Introduction, Peter H. Goodrich Select Bibliography Part I: The Evolution of the Legend 1. Early Stages in the Development of the Merlin Legend, A.O.H. Jarman 2. The Prophet and the Magician, Paul Zumthor 3. Merlin and the Ladies of the Lake, Anne Berthelot 4. Merlin in Italian Literature, Donald L. Hoffman 5. Merlin in Iberian Literature, Barbara D. Miller 6. Merlin in German Literature, Ulrich Muller 7. Merlin as New-World Wizard, Alan C. Lupack 8. The Enchanter Awakes: Merlin in Modern Fiction, Raymond H. Thompson Part II. Major Motifs and Works 9. Merlin as Wise Old Man, Heinrich Zimmer 10. Merlin in the Grail Legend, Emma Jung and Marie-Louise von Franz 11. Robert de Boron's Merlin, Alexandre Micha 12. Merlin Romancier: Paternity, Prophecy, and Poetics in the Huth Merlin, Kate Cooper 13. Malory's Tragic Merlin, Donald L. Hoffman 14. Spenser's Merlin, William Blackburn 15. Druids, Bards, and Tennyson's Merlin, Catherine Barnes Stevenson 16. Illusion and Relation: Merlin as an Image of the Artist in Tennyson, Dore, Burne-Jones, and Beardsley, Linda K. Hughes 17. Master and Mediator of the Natural World, Jean Markale Proper Name Index FINE/FINE. Book.

Condición: New. In.

Condición: New.

Paperback. Condición: New. 1999 ed. This book constitutes the thoroughly refereed post-workshop proceedings of the International Workshop on Algorithmic Engineering and Experimentation, ALENEX'99, held in Baltimore, Maryland, USA, in January 1999.The 20 revised full papers presented were carefully selected from a total of 42 submissions during two rounds of reviewing and improvement. The papers are organized in sections on combinatorial algorithms, computational geometry, software and applications, algorithms for NP-hard problems, and data structures.

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cient solutions to two widely di erent types of problems - linked list pre x com- tations and generalized sorting. Both problems are memory intensive, but in die rent ways. Whereas generalized sorting algorithms typically require a large numberofmemoryaccesses, they areusuallytocontiguousmemorylocations. By contrast, prex computation algorithms typically require a more modest qu- tity of memory accesses, but they are are usually to non-contiguous memory locations.

Taschenbuch. Condición: Neu. Algorithm Engineering and Experimentation | International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers | Michael T. Goodrich (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 1999 | Springer | EAN 9783540662273 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.

Paperback. Condición: New. 1999th.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cient solutions to two widely di erent types of problems - linked list pre x com- tations and generalized sorting. Both problems are memory intensive, but in die rent ways. Whereas generalized sorting algorithms typically require a large numberofmemoryaccesses, they areusuallytocontiguousmemorylocations. By contrast, prex computation algorithms typically require a more modest qu- tity of memory accesses, but they are are usually to non-contiguous memory locations. 364 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challe.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cient solutions to two widely di erent types of problems - linked list pre x com- tations and generalized sorting. Both problems are memory intensive, but in die rent ways. Whereas generalized sorting algorithms typically require a large numberofmemoryaccesses, they areusuallytocontiguousmemorylocations. By contrast, prex computation algorithms typically require a more modest qu- tity of memory accesses, but they are are usually to non-contiguous memory locations.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 364 pp. Englisch.