9783540439776 - algorithm engineering and experiments: 4th international workshop, alenex 2002, san francicsco, ca, usa, january 4-5, 2002, revised papers: 2409 di stein, clifford; mount, david m. (11 risultati)
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 63,06
EUR 2,28 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 60,62
EUR 13,88 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,04
EUR 17,95 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Paperback. Condizione: New.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 74,37
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,00
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 66,74
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 61,71 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - TheannualworkshoponAlgorithmEngineeringandExperiments(ALENEX) providesaforumforthepresentationoforiginalresearchintheimplementation andexperimentalevaluationofalgorithmsanddatastructures. ALENEX2002 wasthefourthworkshopinthisseries. ItwasheldinSan…Francisco,California onJanuary4 5,2002. Thisvolumecollectsextendedversionsofthe15papers thatwereselectedforpresentationfromapoolof34submissions. Wewouldliketothankthesponsors,authors,andreviewerswhohelpedmake ALENEX2002asuccess. Wealsowanttothanktheinvitedspeakers,Cynthia PhillipsofSandiaNationalLaboratories,MartinFarach-ColtonofGoogle,and MichaelKassofPixar. Finally,wewouldliketothankSpringer-Verlagfor- blishingthesepapersintheirLectureNotesinComputerScience series. May2002 DavidM. Mount Cli ordStein ALENEX2002Sponsors Thefollowingorganizationsprovideddirect nancialsupport,whichenabledus tohostinvitedspeakersandprovidereducedregistrationfeesforstudents. SandiaNationalLaboratories AkamiTechnologiesInc. NECResearch Thefollowingprovidedin-kindsupport,facilitatingtheworkshop. SIAM,theSocietyforIndustrialandAppliedMathematics SIGACT,theACMSIGonAlgorithmsandComputationTheory ColumbiaUniversity ALENEX2002ProgramCommittee NancyAmato(TexasA&MUniversity) MarshallBern(XeroxPARC) MichaelGoodrich(UniversityofCalifornia,Irvine) TomMcCormick(UniversityofBritishColumbia) MichaelMitzenmacher(HarvardUniversity) DavidMount(UniversityofMaryland;Co-chair) GiriNarasimhan(FloridaInternationalUniversity) RajeevRaman(UniversityofLeicester) Cli ordStein(ColumbiaUniversity;Co-chair) VI ALENEX2002 ALENEX2002SteeringCommittee MichaelGoodrich(UniversityofCalifornia,Irvine) AdamBuchsbaum(AT&TLabs) RobertoBattiti(UniversityofTrento,Italy) AndrewV. Goldberg(IntertrustSTARLab) MichaelT. Goodrich(UniversityofCalifornia,Irvine) DavidS. Johnson(AT&TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico;chair) JackSnoeyink(UNC-ChapelHill) TableofContents ALENEX2002 OntheImplementationofMST-BasedHeuristicsfortheSteinerProblem inGraphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 M. PoggideArag ao,R. F. Werneck(CatholicUniversityof RiodeJaneiro) ATime-SensitiveSystemforBlack-BoxCombinatorialOptimization . . . . . 16 V. Phan,P. Sumazin,S. Skiena(SUNYStonyBrook) ACompressedBreadth-FirstSearchforSatis ability . . . . . . . . . . . . . . . . . . . 29 D. B. Motter,I. L. Markov(UniversityofMichigan) UsingMulti-levelGraphsforTimetableInformationinRailwaySystems . . 43 F. Schulz,D. Wagner(UniversityofKonstanz),C. Zaroliagis (UniversityofPatras) EvaluatingtheLocalRatioAlgorithmforDynamicStorageAllocation . . . 60 K. Pruhs(UniversityofPittsburgh),E. Wiewiora(Universityof California,SanDiego) An Experimental Study of Prefetching and Caching Algorithms for the WorldWideWeb . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 M. Curcio,S. Leonardi,A. Vitaletti (Universit`adiRoma LaSapienza ) TheTreewidthofJavaPrograms. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 J. Gustedt(LORIA&INRIALorraine),O. A. Mæhle,J. A. Telle (UniversityofBergen) PartitioningPlanarGraphswithCostsandWeights. . . . . . . . . . . . . . . . . . . . 98 L. Aleksandrov(BulgarianAcademyofSciences,CarletonUniversity), H. Djidjev(UniversityofWarwick),H. Guo,A. Maheshwari (CarletonUniversity) MaintainingDynamicMinimumSpanningTrees:AnExperimentalStudy . 111 G. Cattaneo,P. Faruolo,U. F. Petrillo(Universit`adiSalerno), G. F. Italiano(Universit`adiRoma TorVergata ) ExperimentalEvaluationofaNewShortestPathAlgorithm . . . . . . . . . . . . 126 S. Pettie,V. Ramachandran,S. Sridhar(UniversityofTexasatAustin) GettingMorefromOut-of-CoreColumnsort. . . . . . . . . . . . . . . . . . . . . . . . . . . 143 G. Chaudhry,T. H. Cormen(DartmouthCollege) VIII TableofContents TopologicalSweepinDegenerateCases . . . . . . . . . . . . . . . . . . . . . .
Altre immagini- Brossura
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 and Experiments | 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers | David M. Mount (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2002 | Springer | EAN 9783540439776 | Verantwortliche Person für die EU: Spring…er Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.
- Brossura
- Print on Demand
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
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. ALENEX 2002.- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.- A Time-Sensitive System for Black-Box Combinatorial Optimization.- A Compressed Breadth-First Search for Satisfiability.…- Using Multi-level Graphs for Timetable .
- 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 74,89
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 -TheannualworkshoponAlgorithmEngineeringandExperiments(ALENEX) providesaforumforthepresentationoforiginalresearchintheimplementation andexperimentalevaluationofalgorithmsanddatastructures. ALENEX2002 wasthefourthworkshopinthisseries…. ItwasheldinSanFrancisco,California onJanuary4 5,2002. Thisvolumecollectsextendedversionsofthe15papers thatwereselectedforpresentationfromapoolof34submissions. Wewouldliketothankthesponsors,authors,andreviewerswhohelpedmake ALENEX2002asuccess. Wealsowanttothanktheinvitedspeakers,Cynthia PhillipsofSandiaNationalLaboratories,MartinFarach-ColtonofGoogle,and MichaelKassofPixar. Finally,wewouldliketothankSpringer-Verlagfor- blishingthesepapersintheirLectureNotesinComputerScience series. May2002 DavidM. Mount Cli ordStein ALENEX2002Sponsors Thefollowingorganizationsprovideddirect nancialsupport,whichenabledus tohostinvitedspeakersandprovidereducedregistrationfeesforstudents. SandiaNationalLaboratories AkamiTechnologiesInc. NECResearch Thefollowingprovidedin-kindsupport,facilitatingtheworkshop. SIAM,theSocietyforIndustrialandAppliedMathematics SIGACT,theACMSIGonAlgorithmsandComputationTheory ColumbiaUniversity ALENEX2002ProgramCommittee NancyAmato(TexasA&MUniversity) MarshallBern(XeroxPARC) MichaelGoodrich(UniversityofCalifornia,Irvine) TomMcCormick(UniversityofBritishColumbia) MichaelMitzenmacher(HarvardUniversity) DavidMount(UniversityofMaryland;Co-chair) GiriNarasimhan(FloridaInternationalUniversity) RajeevRaman(UniversityofLeicester) Cli ordStein(ColumbiaUniversity;Co-chair) VI ALENEX2002 ALENEX2002SteeringCommittee MichaelGoodrich(UniversityofCalifornia,Irvine) AdamBuchsbaum(AT&TLabs) RobertoBattiti(UniversityofTrento,Italy) AndrewV. Goldberg(IntertrustSTARLab) MichaelT. Goodrich(UniversityofCalifornia,Irvine) DavidS. Johnson(AT&TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico;chair) JackSnoeyink(UNC-ChapelHill) TableofContents ALENEX2002 OntheImplementationofMST-BasedHeuristicsfortheSteinerProblem inGraphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 M. PoggideArag ao,R. F. Werneck(CatholicUniversityof RiodeJaneiro) ATime-SensitiveSystemforBlack-BoxCombinatorialOptimization . . . . . 16 V. Phan,P. Sumazin,S. Skiena(SUNYStonyBrook) ACompressedBreadth-FirstSearchforSatis ability . . . . . . . . . . . . . . . . . . . 29 D. B. Motter,I. L. Markov(UniversityofMichigan) UsingMulti-levelGraphsforTimetableInformationinRailwaySystems . . 43 F. Schulz,D. Wagner(UniversityofKonstanz),C. Zaroliagis (UniversityofPatras) EvaluatingtheLocalRatioAlgorithmforDynamicStorageAllocation . . . 60 K. Pruhs(UniversityofPittsburgh),E. Wiewiora(Universityof California,SanDiego) An Experimental Study of Prefetching and Caching Algorithms for the WorldWideWeb . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 M. Curcio,S. Leonardi,A. Vitaletti (Universit`adiRoma LaSapienza ) TheTreewidthofJavaPrograms. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 J. Gustedt(LORIA&INRIALorraine),O. A. Mæhle,J. A. Telle (UniversityofBergen) PartitioningPlanarGraphswithCostsandWeights. . . . . . . . . . . . . . . . . . . . 98 L. Aleksandrov(BulgarianAcademyofSciences,CarletonUniversity), H. Djidjev(UniversityofWarwick),H. Guo,A. Maheshwari (CarletonUniversity) MaintainingDynamicMinimumSpanningTrees:AnExperimentalStudy . 111 G. Cattaneo,P. Faruolo,U. F. Petrillo(Universit`adiSalerno), G. F. Italiano(Universit`adiRoma TorVergata ) ExperimentalEvaluationofaNewShortestPathAlgorithm . . . . . . . . . . . . 126 S. Pettie,V. Ramachandran,S. Sridhar(UniversityofTexasatAustin) GettingMorefromOut-of-CoreColumnsort. . . . . . . . . . . . . . . . . . . . . . . . . . . 143 G. Chaudhry,T. H. Cormen(DartmouthCollege) VIII TableofContents TopologicalSweepinDegenerateCases . . . . . . . . . . . . . .
- 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 -ALENEX 2002.- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.- A Time-Sensitive System for Black-Box Combinatorial Optimization.- A Compressed Breadth-First Search for Satisfiability.- Using Multi-level… Graphs for Timetable Information in Railway Systems.- Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation.- An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web.- The Treewidth of Java Programs.- Partitioning Planar Graphs with Costs and Weights.- Maintaining Dynamic Minimum Spanning Trees: An Experimental Study.- Experimental Evaluation of a New Shortest Path Algorithm.- Getting More from Out-of-Core Columnsort.- Topological Sweep in Degenerate Cases.- Acceleration of K-Means and Related Clustering Algorithms.- STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects.- An Improvement on Tree Selection Sort.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 220 pp. Englisch.
