Importo totale (1 articolo articoli):
Destinazione ordine:
buchsbaum adam (17 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (17)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (13)
- Come nuovo, Ottimo o Quasi ottimo (2)
- Molto buono o Buono (1)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (1)
Legatura
- Tutte
- Rilegato (Nessun altro risultato corrispondente a questo perfezionamento)
- Brossura (17)
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (9)
- Non Print on Demand (13)
Lingua (1)
Spedizione gratuita
- Spedizione gratuita in U.S.A. (Nessun altro risultato corrispondente a questo perfezionamento)
Paese del venditore
Valutazione venditore
-
Algorithm Engineering and Experimentation. Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers.
Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
Membro dell'associazione: GIAQ ILAB VDA
Valutazione del venditore 4 su 5 stelle
EUR 9,00
Spedizione EUR 30,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloVIII, 229 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2153. Sprache: Englisch.
-
Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers (Lecture Notes in Computer Science)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
-
Algorithm Engineering and Experimentation : Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 58,25
Spedizione EUR 2,25
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers (Lecture Notes in Computer Science, 2153)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 60,16
Spedizione EUR 13,87
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 56,78
Spedizione EUR 17,94
Spedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
-
Algorithm Engineering and Experimentation : Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 59,74
Spedizione EUR 17,37
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithm Engineering and Experimentation : Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 73,99
Spedizione EUR 2,25
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithm Engineering and Experimentation : Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 64,35
Spedizione EUR 17,37
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Algorithm Engineering and Experimentation
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 244.
-
Algorithm Engineering and Experimentation: Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 76,75
Spedizione EUR 11,58
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1st edition. 231 pages. 9.00x6.00x0.50 inches. In Stock.
-
Algorithm Engineering and Experimentation
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2001
ISBN 10: 3540425608 ISBN 13: 9783540425601
EUR 48,37
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2001
ISBN 10: 3540425608 ISBN 13: 9783540425601
EUR 53,49
Spedizione EUR 61,88
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The aim of the annual Workshop on Algorithm Engineering and Experiments (ALENEX)istoprovideaforumforthepresentationoforiginalresearchinthe implementationandexperimentalevaluationofalgorithmsanddatastructures. ALENEX2001,thethirdintheseries,washeldinWashington,DC,onJanuary 5 6, 2001. This volume collects extended versions of the 15 papers that were selected for presentation from a pool of 31 submissions. It also includes the abstracts from the three invited speakers, who were supported by DIMACS SpecialFocusonNextGenerationNetworks. Wewouldliketotakethisopportunitytothankthesponsors,authors,and reviewers that made ALENEX 2001 a success. We would also like to thank Springer-Verlag for publishing these papers in their series ofLecture Notes in ComputerScience. June2001 AdamBuchsbaum JackSnoeyink ALENEX2001Sponsors Thefollowingprovideddirect nancialsupport,whichenabledustohostinvited speakersandprovidereducedregistrationfeestostudents. DIMACSSpecialFocusonNextGenerationNetworks TheHopkinsCenterforAlgorithmEngineering NECResearchInstitute Thefollowingprovidedin-kindsupport,facilitatingtheworkshop. AT&T SIAM,theSocietyforIndustrialandAppliedMathematics SIGACT,theACMSIGonAlgorithmsandComputationTheory ALENEX2001ProgramCommittee NinaAmenta,(UniversityofTexas,Austin) AdamBuchsbaum,(AT&TLabs Research;Co-chair) RudolfFleischer,(HongKongUniversityofScience&Technology) LyleMcGeoch,(AmherstCollege) S. Muthukrishnan,(AT&TLabs Research) JackSnoeyink,(UniversityofNorthCarolina,ChapelHill;Co-chair) MattStallmann(NorthCarolinaStateUniversity) DorotheaWagner(Universit atKonstanz) VI Preface ALENEX 01ExternalReviewers SunilArya RolfDrechsler MarinaPapatrianta lou LydiaAyers LeszekGasieniec FrankSchulz ThereseBiedl Ra aeleGiancarlo MichaelSeel UlrikBrandes RobertoGrossi JopSibeyn FrancBrglez DavidJohnson RobertoSolis-Oba KenClarkson JuhaK arkk ainen ThomasWillhalm SabineCornelsen BernardMoret ALENEXSteeringCommittee RobertoBattiti(UniversityofTrento,Italy) AndrewV. Goldberg(IntertrustSTARLab) MichaelT. Goodrich(JohnsHopkinsUniversity) DavidS. Johnson(AT&TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico,chair) TableofContents ALENEX 01 Solvinga Hard ProblemtoApproximatean Easy One:Heuristicsfor MaximumMatchingsandMaximumTravelingSalesmanProblems. . . . . . . 1 S. P. Fekete (TU Berlin), H. Meijer (Queen s University), A. Rohe (Universit atBonn),andW. Tietze(TUBerlin) CNOP APackageforConstrainedNetworkOptimization. . . . . . . . . . . . . 17 K. MehlhornandM. Ziegelmann(MPISaarbrucken) TheAsymmetricTravelingSalesmanProblem: Algorithms,InstanceGenerators,andTests. . . . . . . . . . . . . . . . . . . . . . . . . . . 32 J. Cirasella (Boston Arch. Center Library), D. S. Johnson (AT&T), L. A. McGeoch,(AmherstCollege),andW. Zhang(WUSTL) NetworkTomographythroughEnd-to-EndMeasurements . . . . . . . . . . . . . . 60 D. Towsley(UMass. ,Amherst) ExperimentalResultsonStatisticalApproaches toPageReplacementPolicies. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 V. Leung (Sandia National Laboratories) and S. Irani (University of California,Irvine) EstimatingResemblanceofMIDIDocuments. . . . . . . . . . . . . . . . . . . . . . . . . . 78 M. MitzenmacherandS. Owen(Harvard) ExperimentsonAdaptiveSetIntersectionsforTextRetrievalSystems. . . . 91 E. D. Demaine(UWaterloo),A. L opez-Ortiz(Univ. ofNewBrunswick), andJ. I. Munro(UWaterloo) PVD:AStableImplementationforComputingVoronoiDiagrams ofPolygonalPockets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 S. Sethia,M. Held,andJ. S. B. Mitchell(SUNYStonyBrook) HierarchicalClusteringofTrees:AlgorithmsandExperiments. . . . . . . . . . . 117 I. FinocchiandR. Petreschi(Universit`adiRoma LaSapienza ) TravelPlanningwithSelf-MadeMaps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 U. Brandes, F. Schulz, D. Wagner, and T.
-
EUR 50,25
Spedizione EUR 70,00
Spedito da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Algorithm Engineering and Experimentation | Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers | Adam L. Buchsbaum (u. a.) | Taschenbuch | viii | Englisch | 2001 | Springer | EAN 9783540425601 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Algorithm Engineering and Experimentation
Lingua: Inglese
Editore: Springer Berlin Heidelberg Sep 2001, 2001
ISBN 10: 3540425608 ISBN 13: 9783540425601
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 53,49
Spedizione EUR 23,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The aim of the annual Workshop on Algorithm Engineering and Experiments (ALENEX)istoprovideaforumforthepresentationoforiginalresearchinthe implementationandexperimentalevaluationofalgorithmsanddatastructures. ALENEX2001,thethirdintheseries,washeldinWashington,DC,onJanuary 5 6, 2001. This volume collects extended versions of the 15 papers that were selected for presentation from a pool of 31 submissions. It also includes the abstracts from the three invited speakers, who were supported by DIMACS SpecialFocusonNextGenerationNetworks. Wewouldliketotakethisopportunitytothankthesponsors,authors,and reviewers that made ALENEX 2001 a success. We would also like to thank Springer-Verlag for publishing these papers in their series ofLecture Notes in ComputerScience. June2001 AdamBuchsbaum JackSnoeyink ALENEX2001Sponsors Thefollowingprovideddirect nancialsupport,whichenabledustohostinvited speakersandprovidereducedregistrationfeestostudents. DIMACSSpecialFocusonNextGenerationNetworks TheHopkinsCenterforAlgorithmEngineering NECResearchInstitute Thefollowingprovidedin-kindsupport,facilitatingtheworkshop. AT&T SIAM,theSocietyforIndustrialandAppliedMathematics SIGACT,theACMSIGonAlgorithmsandComputationTheory ALENEX2001ProgramCommittee NinaAmenta,(UniversityofTexas,Austin) AdamBuchsbaum,(AT&TLabs Research;Co-chair) RudolfFleischer,(HongKongUniversityofScience&Technology) LyleMcGeoch,(AmherstCollege) S. Muthukrishnan,(AT&TLabs Research) JackSnoeyink,(UniversityofNorthCarolina,ChapelHill;Co-chair) MattStallmann(NorthCarolinaStateUniversity) DorotheaWagner(Universit atKonstanz) VI Preface ALENEX 01ExternalReviewers SunilArya RolfDrechsler MarinaPapatrianta lou LydiaAyers LeszekGasieniec FrankSchulz ThereseBiedl Ra aeleGiancarlo MichaelSeel UlrikBrandes RobertoGrossi JopSibeyn FrancBrglez DavidJohnson RobertoSolis-Oba KenClarkson JuhaK arkk ainen ThomasWillhalm SabineCornelsen BernardMoret ALENEXSteeringCommittee RobertoBattiti(UniversityofTrento,Italy) AndrewV. Goldberg(IntertrustSTARLab) MichaelT. Goodrich(JohnsHopkinsUniversity) DavidS. Johnson(AT&TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico,chair) TableofContents ALENEX 01 Solvinga Hard ProblemtoApproximatean Easy One:Heuristicsfor MaximumMatchingsandMaximumTravelingSalesmanProblems. . . . . . . 1 S. P. Fekete (TU Berlin), H. Meijer (Queen s University), A. Rohe (Universit atBonn),andW. Tietze(TUBerlin) CNOP APackageforConstrainedNetworkOptimization. . . . . . . . . . . . . 17 K. MehlhornandM. Ziegelmann(MPISaarbrucken) TheAsymmetricTravelingSalesmanProblem: Algorithms,InstanceGenerators,andTests. . . . . . . . . . . . . . . . . . . . . . . . . . . 32 J. Cirasella (Boston Arch. Center Library), D. S. Johnson (AT&T), L. A. McGeoch,(AmherstCollege),andW. Zhang(WUSTL) NetworkTomographythroughEnd-to-EndMeasurements . . . . . . . . . . . . . . 60 D. Towsley(UMass. ,Amherst) ExperimentalResultsonStatisticalApproaches toPageReplacementPolicies. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 V. Leung (Sandia National Laboratories) and S. Irani (University of California,Irvine) EstimatingResemblanceofMIDIDocuments. . . . . . . . . . . . . . . . . . . . . . . . . . 78 M. MitzenmacherandS. Owen(Harvard) ExperimentsonAdaptiveSetIntersectionsforTextRetrievalSystems. . . . 91 E. D. Demaine(UWaterloo),A. L opez-Ortiz(Univ. ofNewBrunswick), andJ. I. Munro(UWaterloo) PVD:AStableImplementationforComputingVoronoiDiagrams ofPolygonalPockets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 S. Sethia,M. Held,andJ. S. B. Mitchell(SUNYStonyBrook) HierarchicalClusteringofTrees:AlgorithmsandExperiments. . . . . . . . . . . 117 I. FinocchiandR. Petreschi(Universit`adiRoma LaSapienza ) TravelPlanningwithSelf-MadeMaps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 U. Brandes, F. Schulz, D. Wagner, and T. 244 pp. Englisch.
-
Algorithm Engineering and Experimentation
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 78,33
Spedizione EUR 7,53
Spedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 244 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Algorithm Engineering and Experimentation
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 78,65
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 244.
-
Algorithm Engineering and Experimentation
Lingua: Inglese
Editore: Springer, Springer Sep 2001, 2001
ISBN 10: 3540425608 ISBN 13: 9783540425601
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
EUR 53,49
Spedizione EUR 60,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -ALENEX'01.- Solving a 'Hard' Problem to Approximate an 'Easy' One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.- CNOP - A Package for Constrained Network Optimization.- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests.- Network Tomography through End-to-End Measurements.- Experimental Results on Statistical Approaches to Page Replacement Policies.- Estimating Resemblance of MIDI Documents.- Experiments on Adaptive Set Intersections for Text Retrieval Systems.- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets.- Hierarchical Clustering of Trees: Algorithms and Experiments.- Travel Planning with Self-Made Maps.- New Algorithmic Challenges Arising in Measurement-Driven Networking Research.- A Probabilistic Spell for the Curse of Dimensionality.- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube.- An Empirical Study of a New Approach to Nearest Neighbor Searching.- Spectral Analysis for Data Mining.- Trade Off Between Compression and Search Times in Compact Suffix Array.- Implementation of a PTAS for Scheduling with Release Dates.- Biased Skip Lists for Highly Skewed Access Patterns.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 244 pp. Englisch.
