This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002.The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms.
"Sinopsis" puede pertenecer a otra edición de este libro.
This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002.
The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: -OnTimeBooks-, Phoenix, AZ, Estados Unidos de America
Condición: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail. Nº de ref. del artículo: OTV.3540439773.VG
Cantidad disponible: 1 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Nº de ref. del artículo: 6666-IUK-9783540439776
Cantidad disponible: 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 986444-n
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 986444
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 986444-n
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In English. Nº de ref. del artículo: ria9783540439776_new
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 986444
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Condición: 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 . Nº de ref. del artículo: 4890766
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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 . . . . . . . . . . . . . . Nº de ref. del artículo: 9783540439776
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783540439776
Cantidad disponible: 1 disponibles