Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithm engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 : proceedings / / Jeffrey S. Vitter, Christos D. Zaroliagis, editors
| Algorithm engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 : proceedings / / Jeffrey S. Vitter, Christos D. Zaroliagis, editors |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (VIII, 368 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer algorithms
Software engineering |
| ISBN | 3-540-48318-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465617903316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithm Engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings / / edited by Jeffrey S. Vitter, Christos D. Zaroliagis
| Algorithm Engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings / / edited by Jeffrey S. Vitter, Christos D. Zaroliagis |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999 |
| Descrizione fisica | 1 online resource (VIII, 368 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computer science Algorithms Numerical analysis Computer networks Discrete mathematics Programming Techniques Theory of Computation Numerical Analysis Computer Communication Networks Discrete Mathematics |
| ISBN | 3-540-48318-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910767572103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Robust and online large-scale optimization : models and techniques for transportation systems / / Ravindra K. Ahuja, Rolf H. Mohring, Christos D. Zaroliagis (eds.)
| Robust and online large-scale optimization : models and techniques for transportation systems / / Ravindra K. Ahuja, Rolf H. Mohring, Christos D. Zaroliagis (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XVIII, 423 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) |
AhujaRavindra K. <1956->
MohringR. H (Rolf H.) ZaroliagisChristos D. <1963-> |
| Collana |
Lecture notes in computer science
State-of-the-art survey |
| Soggetto topico |
Mathematical optimization
Transportation - Planning |
| ISBN | 3-642-05465-X |
| Classificazione |
004
BAU 853f MAT 910f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Robustness and Recoverability: New Concepts -- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications -- Recoverable Robustness in Shunting and Timetabling -- Light Robustness -- Incentive-Compatible Robust Line Planning -- A Bicriteria Approach for Robust Timetabling -- Robust Timetabling and Route Planning -- Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling -- Engineering Time-Expanded Graphs for Faster Timetable Information -- Time-Dependent Route Planning -- The Exact Subgraph Recoverable Robust Shortest Path Problem -- Efficient Timetable Information in the Presence of Delays -- Robust Planning under Scarce Resources -- Integrating Robust Railway Network Design and Line Planning under Failures -- Effective Allocation of Fleet Frequencies by Reducing Intermediate Stops and Short Turning in Transit Systems -- Shunting for Dummies: An Introductory Algorithmic Survey -- Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol -- Online Planning: Delay and Disruption Management -- Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data -- Rescheduling Dense Train Traffic over Complex Station Interlocking Areas -- Online Train Disposition: To Wait or Not to Wait? -- Disruption Management in Passenger Railway Transportation. |
| Record Nr. | UNINA-9910483050603321 |
| Berlin, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||