9783540664277 - algorithm engineering: 3rd international workshop, wae'99 london, uk, july 19-21, 1999 proceedings: 1668 di zaroliagis, christos d.; vitter, jeffrey s. (17 risultati)
- Altre immagini
Algorithm Engineering : 3rd International Workshop, Wae'99 London, Uk, July 19-21, 1999 : Proceedings
International Workshop on Algorithm Engineering 1999 (London, England); Vitter, Jeffrey Scott (EDT); Zaroliagis, Christos D. (EDT)
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 56,11
EUR 2,29 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Altre immagini
- Brossura
Da: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 58,49
Spedizione gratuitaSpedito in U.S.A.Quantità: 5 disponibili
Paperback or Softback. Condizione: New. Algorithm Engineering: 3rd International Workshop, Wae'99 London, Uk, July 19-21, 1999 Proceedings. Book.
- Brossura
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 60,87
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Altre immagini
Algorithm Engineering : 3rd International Workshop, Wae'99 London, Uk, July 19-21, 1999 : Proceedings
International Workshop on Algorithm Engineering 1999 (London, England); Vitter, Jeffrey Scott (EDT); Zaroliagis, Christos D. (EDT)
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 59,51
EUR 2,29 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 61,05
EUR 13,98 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 57,46
EUR 18,07 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
PF. Condizione: New.
- Altre immagini
Algorithm Engineering : 3rd International Workshop, Wae'99 London, Uk, July 19-21, 1999 : Proceedings
International Workshop on Algorithm Engineering 1999 (London, England); Vitter, Jeffrey Scott (EDT); Zaroliagis, Christos D. (EDT)
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,44
EUR 17,50 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 77,87
EUR 3,47 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 376.
- Altre immagini
Algorithm Engineering : 3rd International Workshop, Wae'99 London, Uk, July 19-21, 1999 : Proceedings
International Workshop on Algorithm Engineering 1999 (London, England); Vitter, Jeffrey Scott (EDT); Zaroliagis, Christos D. (EDT)
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 65,94
EUR 17,50 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Altre immagini
- Brossura
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Kartoniert / Broschiert. Condizione: New.
- Altre immagini
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 62,85 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) bri- ingmodel'. Thismodel isdesignated asa programmer smodelfora ne-grained computation framework cal…led Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set. This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented.
- Brossura
- Print on Demand
Da: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 61,19
Spedizione gratuitaSpedito in U.S.A.Quantità: 10 disponibili
Condizione: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Altre immagini
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1999, 1999
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) bri- ingmodel'. Thismodel isdesignated asa programmer smodelfora ne-grained computati…on framework called Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set. This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented. 376 pp. Englisch.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 77,07
EUR 7,58 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 376 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 78,56
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 376.
- Altre immagini
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Lectures.- Selecting Problems for Algorithm Evaluation.- BSP Algorithms - 'Write Once, Run Anywhere'.- Ten Years of LEDA: Some Thoughts.- Contributed Papers.- Computing the K Shortest Paths: A New Algorithm and an Experimental…Comparison.- Efficient Implementation of Lazy Suffix Trees.- Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism.- Finding Minimum Congestion Spanning Trees.- Evaluation of an Algorithm for the Transversal Hypergraph Problem.- Construction Heuristics and Domination Analysis for the Asymmetric TSP.- Counting in Mobile Networks: Theory and Experimentation.- Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.- Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.- On-Line Zone Construction in Arrangements of Lines in the Plane.- The Design and Implementation of Planar Maps in CGAL.- An Easy to Use Implementation of Linear Perturbations within Cupgal.- Analysing Cache Effects in Distribution Sorting.- Fast Regular Expression Search.- An Experimental Evaluation of Hybrid Data Structures for Searching.- LEDA-SM: Extending LEDA to Secondary Memory.- A Priority Queue Transform.- Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.- Estimating Large Distances in Phylogenetic Reconstruction.- The Performance of Concurrent Red-Black Tree Algorithms.- Performance Engineering Case Study: Heap Construction.- A Fast and Simple Local Search for Graph Coloring.- BALL: Biochemical Algorithms Library.- An Experimental Study of Priority Queues in External Memory.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 376 pp. Englisch.
- Altre immagini
- Brossura
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,25
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Algorithm Engineering | 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings | Jeffrey S. Vitter (u. a.) | Taschenbuch | viii | Englisch | 1999 | Springer | EAN 9783540664277 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juerge…n[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
