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.
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers / / edited by Dan Alistarh, Alex Delis, George Pallis
| Algorithmic Aspects of Cloud Computing [[electronic resource] ] : Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers / / edited by Dan Alistarh, Alex Delis, George Pallis |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 171 p. 60 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Application software Artificial intelligence—Data processing Computer networks Discrete Mathematics in Computer Science Computer and Information Systems Applications Data Science Computer Communication Networks |
| ISBN | 3-319-74875-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Invited Paper -- Warehouse-Scale Computing in the Post-Moore Era -- 1 Heterogeneity in Platforms -- 2 Massive Data Analytics -- References -- Optimization for Cloud Services -- A Walk in the Clouds: Routing Through VNFs on Bidirected Networks -- 1 Introduction -- 1.1 Model -- 1.2 Contributions -- 1.3 Related Work -- 1.4 Paper Organization -- 2 The Unordered BWRP -- 2.1 An Introduction to (Unordered) Waypoint Routing -- 2.2 Hardness and Improved Approximation -- 3 Ordered BWRP -- 3.1 A Constant Number of Waypoints Is Feasible -- 3.2 Optimally Solving OBWRP Is NP-Hard -- 3.3 Optimality on the Cactus with Constant Capacity -- 4 Conclusion -- References -- Service Chain Placement in SDNs -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 Preliminaries -- 3 Hardness Results -- 4 Algorithms for Physical Directed Acyclic Graphs -- 4.1 Placing a Sub-chain in a Physical Node -- 4.2 Placing a Service Chain -- 4.3 Placing a Service Chain with a Latency Bound -- 4.4 FPTAS for General Costs -- 5 General Networks -- References -- Tight Approximability of the Server Allocation Problem for Real-Time Applications -- 1 Introduction -- 2 Approximation Algorithms -- 2.1 Case 1: Metric in SU -- 2.2 Case 2: Metric in S -- 3 Hardness of Approximation -- 4 Experiments -- 4.1 Acceleration of the Proposed Algorithms -- 4.2 Experiment 1: Following Kawabata et al. KCO16 -- 4.3 Experiment 2: With More Servers -- References -- Computing with Risk and Uncertainty -- Risk Aware Stochastic Placement of Cloud Services: The Case of Two Data Centers -- 1 Introduction -- 2 The Normal Two Bin Case -- 2.1 The Sorting Algorithm -- 2.2 The Correctness Proof -- 3 Other Cost Functions -- 4 Non-normal Distributions -- 4.1 The Berry-Esseen Theorem -- 4.2 Approximating General Independent Distributions with the Normal Distribution.
5 Simulation Results -- 5.1 Results for Synthetic Normally Distributed Data -- 5.2 Results for Real Data -- 6 Conclusions -- A Proving SP-MED Falls into Our Framework -- B Proving SP-MWOP Falls into Our Framework -- C Proving SP-MOP Falls into Our Framework -- D Error Induced by the Reduction to the Normal Distribution -- E Error Induced by Outputting an Integral Solution -- E.1 SP-MED -- E.2 SP-MWOP -- F Unbalancing Bin Capacities Is Always Better -- References -- Towards an Algebraic Cost Model for Graph Operators -- 1 Introduction -- 2 Related Work -- 3 Algebraic Framework -- 3.1 Data Model -- 3.2 Base Operators -- 3.3 Cost Model -- 4 Graph Operator Decomposition -- 4.1 Finding Cycles -- 4.2 Random Walk, Path, and Star-Path -- 4.3 Grid Query -- 5 Experiments -- 5.1 Experimental Setup -- 5.2 Results and Discussion -- 5.3 Including Label Information in the Cost Model -- 6 Conclusions -- A Appendix -- A.1 Random 4-Walk Benchmarks -- References -- Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic Automata -- 1 Introduction and Motivation -- 2 Related Work -- 3 Definitions and Notation -- 4 Using Probabilistic Automata to Answer Queries -- 4.1 Constructing Automata from Queries -- 4.2 The General Method -- 5 Conclusion and Future Work -- References -- Scaling and Cost Models in the Cloud -- Improving Rule-Based Elasticity Control by Adapting the Sensitivity of the Auto-Scaling Decision Timeframe -- 1 Introduction -- 2 Motivation -- 3 The AdaFrame Library -- 3.1 Adaptive Monitoring Estimation Model -- 3.2 Runtime Change Detection -- 4 Evaluation -- 4.1 Testbed 1: Scaling a NoSQL Document Store -- 4.2 Testbed 2: Scaling the Business Logic of a Web Service -- 5 Related Work -- 6 Conclusion -- References -- Risk Aware Stochastic Placement of Cloud Services: The Multiple Data Center Case -- 1 Introduction. 2 Problem Formulation -- 3 Summary of Our Results for Two Data Centers -- 4 Three Cost Functions -- 5 The Double Sorting Framework for More Than Two Data Centers -- 6 A Dynamic Programming Algorithm -- 7 The Moving Sticks (MVS) Algorithm for SP-MWOP -- 8 The Generalized Moving Sticks (GMVS) Algorithm -- 9 Conclusions -- A Simulation Results -- A.1 Results for Synthetic Normally Distributed Data -- References -- Automatic Scaling of Resources in a Storm Topology -- 1 Introduction -- 2 Preliminaries -- 3 Architecture -- 4 Experimental Evaluation -- 5 Related Work -- 6 Conclusions -- References -- Author Index. |
| Record Nr. | UNISA-996465496003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Aspects of Cloud Computing : Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers / / edited by Dan Alistarh, Alex Delis, George Pallis
| Algorithmic Aspects of Cloud Computing : Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers / / edited by Dan Alistarh, Alex Delis, George Pallis |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 171 p. 60 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Application software Artificial intelligence—Data processing Computer networks Discrete Mathematics in Computer Science Computer and Information Systems Applications Data Science Computer Communication Networks |
| ISBN | 3-319-74875-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Invited Paper -- Warehouse-Scale Computing in the Post-Moore Era -- 1 Heterogeneity in Platforms -- 2 Massive Data Analytics -- References -- Optimization for Cloud Services -- A Walk in the Clouds: Routing Through VNFs on Bidirected Networks -- 1 Introduction -- 1.1 Model -- 1.2 Contributions -- 1.3 Related Work -- 1.4 Paper Organization -- 2 The Unordered BWRP -- 2.1 An Introduction to (Unordered) Waypoint Routing -- 2.2 Hardness and Improved Approximation -- 3 Ordered BWRP -- 3.1 A Constant Number of Waypoints Is Feasible -- 3.2 Optimally Solving OBWRP Is NP-Hard -- 3.3 Optimality on the Cactus with Constant Capacity -- 4 Conclusion -- References -- Service Chain Placement in SDNs -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 Preliminaries -- 3 Hardness Results -- 4 Algorithms for Physical Directed Acyclic Graphs -- 4.1 Placing a Sub-chain in a Physical Node -- 4.2 Placing a Service Chain -- 4.3 Placing a Service Chain with a Latency Bound -- 4.4 FPTAS for General Costs -- 5 General Networks -- References -- Tight Approximability of the Server Allocation Problem for Real-Time Applications -- 1 Introduction -- 2 Approximation Algorithms -- 2.1 Case 1: Metric in SU -- 2.2 Case 2: Metric in S -- 3 Hardness of Approximation -- 4 Experiments -- 4.1 Acceleration of the Proposed Algorithms -- 4.2 Experiment 1: Following Kawabata et al. KCO16 -- 4.3 Experiment 2: With More Servers -- References -- Computing with Risk and Uncertainty -- Risk Aware Stochastic Placement of Cloud Services: The Case of Two Data Centers -- 1 Introduction -- 2 The Normal Two Bin Case -- 2.1 The Sorting Algorithm -- 2.2 The Correctness Proof -- 3 Other Cost Functions -- 4 Non-normal Distributions -- 4.1 The Berry-Esseen Theorem -- 4.2 Approximating General Independent Distributions with the Normal Distribution.
5 Simulation Results -- 5.1 Results for Synthetic Normally Distributed Data -- 5.2 Results for Real Data -- 6 Conclusions -- A Proving SP-MED Falls into Our Framework -- B Proving SP-MWOP Falls into Our Framework -- C Proving SP-MOP Falls into Our Framework -- D Error Induced by the Reduction to the Normal Distribution -- E Error Induced by Outputting an Integral Solution -- E.1 SP-MED -- E.2 SP-MWOP -- F Unbalancing Bin Capacities Is Always Better -- References -- Towards an Algebraic Cost Model for Graph Operators -- 1 Introduction -- 2 Related Work -- 3 Algebraic Framework -- 3.1 Data Model -- 3.2 Base Operators -- 3.3 Cost Model -- 4 Graph Operator Decomposition -- 4.1 Finding Cycles -- 4.2 Random Walk, Path, and Star-Path -- 4.3 Grid Query -- 5 Experiments -- 5.1 Experimental Setup -- 5.2 Results and Discussion -- 5.3 Including Label Information in the Cost Model -- 6 Conclusions -- A Appendix -- A.1 Random 4-Walk Benchmarks -- References -- Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic Automata -- 1 Introduction and Motivation -- 2 Related Work -- 3 Definitions and Notation -- 4 Using Probabilistic Automata to Answer Queries -- 4.1 Constructing Automata from Queries -- 4.2 The General Method -- 5 Conclusion and Future Work -- References -- Scaling and Cost Models in the Cloud -- Improving Rule-Based Elasticity Control by Adapting the Sensitivity of the Auto-Scaling Decision Timeframe -- 1 Introduction -- 2 Motivation -- 3 The AdaFrame Library -- 3.1 Adaptive Monitoring Estimation Model -- 3.2 Runtime Change Detection -- 4 Evaluation -- 4.1 Testbed 1: Scaling a NoSQL Document Store -- 4.2 Testbed 2: Scaling the Business Logic of a Web Service -- 5 Related Work -- 6 Conclusion -- References -- Risk Aware Stochastic Placement of Cloud Services: The Multiple Data Center Case -- 1 Introduction. 2 Problem Formulation -- 3 Summary of Our Results for Two Data Centers -- 4 Three Cost Functions -- 5 The Double Sorting Framework for More Than Two Data Centers -- 6 A Dynamic Programming Algorithm -- 7 The Moving Sticks (MVS) Algorithm for SP-MWOP -- 8 The Generalized Moving Sticks (GMVS) Algorithm -- 9 Conclusions -- A Simulation Results -- A.1 Results for Synthetic Normally Distributed Data -- References -- Automatic Scaling of Resources in a Storm Topology -- 1 Introduction -- 2 Preliminaries -- 3 Architecture -- 4 Experimental Evaluation -- 5 Related Work -- 6 Conclusions -- References -- Author Index. |
| Record Nr. | UNINA-9910349261303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Methods for Railway Optimization [[electronic resource] ] : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis
| Algorithmic Methods for Railway Optimization [[electronic resource] ] : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 322 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Transportation engineering Traffic engineering Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Artificial intelligence Computer graphics Transportation Technology and Traffic Engineering Data Science Discrete Mathematics in Computer Science Artificial Intelligence Computer Graphics |
| ISBN | 3-540-74247-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | State of the Art -- The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables — and Beyond -- Cyclic Railway Timetabling: A Stochastic Optimization Approach -- Timetable Information: Models and Algorithms -- Estimates on Rolling Stock and Crew in DSB S-tog Based on Timetables -- A Capacity Test for Shunting Movements -- Railway Crew Pairing Optimization -- Integer Programming Approaches for Solving the Delay Management Problem -- Decision Support Tools for Customer-Oriented Dispatching -- Proceedings of ATMOS 2004 -- An Integrated Methodology for the Rapid Transit Network Design Problem -- A Simulation Approach of Fare Integration in Regional Transit Services -- Intelligent Train Scheduling on a High-Loaded Railway Network -- Platform Assignment -- Finding All Attractive Train Connections by Multi-criteria Pareto Search -- The Railway Traveling Salesman Problem -- Rotation Planning of Locomotive and Carriage Groups with Shared Capacities -- An Estimate of the Punctuality Benefits of Automatic Operational Train Sequencing -- Online Delay Management on a Single Train Line. |
| Record Nr. | UNISA-996465434203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Methods for Railway Optimization : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis
| Algorithmic Methods for Railway Optimization : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 322 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Transportation engineering Traffic engineering Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Artificial intelligence Computer graphics Transportation Technology and Traffic Engineering Data Science Discrete Mathematics in Computer Science Artificial Intelligence Computer Graphics |
| ISBN | 3-540-74247-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | State of the Art -- The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables — and Beyond -- Cyclic Railway Timetabling: A Stochastic Optimization Approach -- Timetable Information: Models and Algorithms -- Estimates on Rolling Stock and Crew in DSB S-tog Based on Timetables -- A Capacity Test for Shunting Movements -- Railway Crew Pairing Optimization -- Integer Programming Approaches for Solving the Delay Management Problem -- Decision Support Tools for Customer-Oriented Dispatching -- Proceedings of ATMOS 2004 -- An Integrated Methodology for the Rapid Transit Network Design Problem -- A Simulation Approach of Fare Integration in Regional Transit Services -- Intelligent Train Scheduling on a High-Loaded Railway Network -- Platform Assignment -- Finding All Attractive Train Connections by Multi-criteria Pareto Search -- The Railway Traveling Salesman Problem -- Rotation Planning of Locomotive and Carriage Groups with Shared Capacities -- An Estimate of the Punctuality Benefits of Automatic Operational Train Sequencing -- Online Delay Management on a Single Train Line. |
| Record Nr. | UNINA-9910768164303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms - ESA 2006 [[electronic resource] ] : 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings / / edited by Yossi Azar, Thomas Erlebach
| Algorithms - ESA 2006 [[electronic resource] ] : 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings / / edited by Yossi Azar, Thomas Erlebach |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVIII, 850 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer networks Software Engineering Numerical Analysis Discrete Mathematics in Computer Science Data Science Computer Communication Networks |
| ISBN | 3-540-38876-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Origami, Linkages, and Polyhedra: Folding with Algorithms -- Reliable and Efficient Geometric Computing -- Some Computational Challenges in Today’s Bio-medicine -- Contributed Papers: Design and Analysis Track -- Kinetic Collision Detection for Convex Fat Objects -- Dynamic Connectivity for Axis-Parallel Rectangles -- Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem -- Cooperative TSP -- Fréchet Distance for Curves, Revisited -- Resource Allocation in Bounded Degree Trees -- Dynamic Algorithms for Graph Spanners -- Latency Constrained Aggregation in Sensor Networks -- Competitive Analysis of Flash-Memory Algorithms -- Contention Resolution with Heterogeneous Job Sizes -- Deciding Relaxed Two-Colorability—A Hardness Jump -- Negative Examples for Sequential Importance Sampling of Binary Contingency Tables -- Estimating Entropy over Data Streams -- Necklaces, Convolutions, and X + Y -- Purely Functional Worst Case Constant Time Catenable Sorted Lists -- Taxes for Linear Atomic Congestion Games -- Spanners with Slack -- Compressed Indexes for Approximate String Matching -- Traversing the Machining Graph -- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games -- Distributed Almost Exact Approximations for Minor-Closed Families -- Spectral Clustering by Recursive Partitioning -- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data -- Dynamic Programming and Fast Matrix Multiplication -- Near-Entropy Hotlink Assignments -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods -- Finding Total Unimodularity in Optimization Problems Solved by Linear Programs -- Preemptive Online Scheduling: Optimal Algorithms for All Speeds -- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization -- Lower and Upper Bounds on FIFO Buffer Management in QoS Switches -- Graph Coloring with Rejection -- A Doubling Dimension Threshold ?(loglogn) for Augmented Graph Navigability -- Violator Spaces: Structure and Algorithms -- Region-Restricted Clustering for Geographic Data Mining -- An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths -- Cheating by Men in the Gale-Shapley Stable Matching Algorithm -- Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold -- Enumerating Spanning and Connected Subsets in Graphs and Matroids -- Less Hashing, Same Performance: Building a Better Bloom Filter -- A Unified Approach to Approximating Partial Covering Problems -- Navigating Low-Dimensional and Hierarchical Population Networks -- Popular Matchings in the Capacitated House Allocation Problem -- Inner-Product Based Wavelet Synopses for Range-Sum Queries -- Approximation in Preemptive Stochastic Online Scheduling -- Greedy in Approximation Algorithms -- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths -- Stochastic Shortest Paths Via Quasi-convex Maximization -- Path Hitting in Acyclic Graphs -- Minimum Transversals in Posi-modular Systems -- An LP-Designed Algorithm for Constraint Satisfaction -- Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing -- Balancing Applied to Maximum Network Flow Problems -- Contributed Papers: Engineering and Applications Track -- Out-of-Order Event Processing in Kinetic Data Structures -- Kinetic Algorithms Via Self-adjusting Computation -- Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions -- Reporting Flock Patterns -- On Exact Algorithms for Treewidth -- An Improved Construction for Counting Bloom Filters -- An MINLP Solution Method for a Water Network Problem -- Skewed Binary Search Trees -- Algorithmic Aspects of Proportional Symbol Maps -- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? -- Multiline Addressing by Network Flow -- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression -- The Price of Resiliency: A Case Study on Sorting with Memory Faults -- How Branch Mispredictions Affect Quicksort -- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces -- Engineering Highway Hierarchies -- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited -- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method. |
| Record Nr. | UNISA-996466038003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms - ESA 2007 [[electronic resource] ] : 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings / / edited by Lars Arge, Michael Hoffmann, Emo Welzl
| Algorithms - ESA 2007 [[electronic resource] ] : 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings / / edited by Lars Arge, Michael Hoffmann, Emo Welzl |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XV, 772 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer networks Software Engineering Numerical Analysis Discrete Mathematics in Computer Science Data Science Computer Communication Networks |
| ISBN | 3-540-75520-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Nash Equilibria: Where We Stand -- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation -- Arrangements in Geometry: Recent Advances and Challenges -- Contributed Papers: Design and Analysis Track -- Nash Equilibria in Voronoi Games on Graphs -- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation -- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks -- Finding Frequent Elements in Non-bursty Streams -- Tradeoffs and Average-Case Equilibria in Selfish Routing -- On the Variance of Subset Sum Estimation -- On Minimum Power Connectivity Problems -- On the Cost of Interchange Rearrangement in Strings -- Finding Mobile Data: Efficiency vs. Location Inaccuracy -- A Faster Query Algorithm for the Text Fingerprinting Problem -- Polynomial Time Algorithms for Minimum Energy Scheduling -- k-Mismatch with Don’t Cares -- Finding Branch-Decompositions and Rank-Decompositions -- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover -- Linear-Time Ranking of Permutations -- Radix Sorting with No Extra Space -- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation -- Order Statistics in the Farey Sequences in Sublinear Time -- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks -- Dial a Ride from k-Forest -- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue -- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication -- Optimal Algorithms for k-Search with Application in Option Pricing -- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra -- Stackelberg Strategies for Atomic Congestion Games -- Good Quality Virtual Realization of Unit Ball Graphs -- Algorithms for Playing Games with Limited Randomness -- Approximation of Partial Capacitated Vertex Cover -- Optimal Resilient Dynamic Dictionaries -- Determining the Smallest k Such That G Is k-Outerplanar -- On the Size of Succinct Indices -- Compact Oracles for Approximate Distances Around Obstacles in the Plane -- Convex Combinations of Single Source Unsplittable Flows -- Farthest-Polygon Voronoi Diagrams -- Equitable Revisited -- Online Scheduling of Equal-Length Jobs on Parallel Machines -- k-Anonymization with Minimal Loss of Information -- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs -- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling -- Bundle Pricing with Comparable Items -- Approximating Interval Scheduling Problems with Bounded Profits -- Pricing Tree Access Networks with Connected Backbones -- Distance Coloring -- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching -- To Fill or Not to Fill: The Gas Station Problem -- Online Bandwidth Allocation -- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems -- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems -- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs -- Dynamic Plane Transitive Closure -- Contributed Papers: Engineering and Applications Track -- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments -- Estimating Clustering Indexes in Data Streams -- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics -- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step -- Fast and Compact Oracles for Approximate Distances in Planar Graphs -- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces -- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks -- Algorithms to Separate -Chvátal-Gomory Cuts -- Fast Lowest Common Ancestor Computations in Dags -- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem -- Solutions to Real-World Instances of PSPACE-Complete Stacking -- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough -- An Experimental Study of New and Known Online Packet Buffering Algorithms. |
| Record Nr. | UNISA-996465433303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms - ESA 2009 [[electronic resource] ] : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings / / edited by Amos Fiat, Peter Sanders
| Algorithms - ESA 2009 [[electronic resource] ] : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings / / edited by Amos Fiat, Peter Sanders |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIX, 790 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Information retrieval Computer architecture Artificial intelligence—Data processing Computer science—Mathematics Computer networks Programming Techniques Data Storage Representation Data Science Mathematics of Computing Computer Communication Networks |
| ISBN | 3-642-04128-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Some Open Questions Related to Cuckoo Hashing -- Trees -- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks -- Improved Approximation Algorithms for Label Cover Problems -- A Linear Time Algorithm for L(2,1)-Labeling of Trees -- Geometry I -- On Inducing Polygons and Related Problems -- Computing 3D Periodic Triangulations -- Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0 -- Mathematical Programming -- Approximability of Sparse Integer Programs -- Iterative Rounding for Multi-Objective Optimization Problems -- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity -- Geometry II -- Constructing Delaunay Triangulations along Space-Filling Curves -- Piercing Translates and Homothets of a Convex Body -- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs -- Algorithmic Game Theory I -- On Revenue Maximization in Second-Price Ad Auctions -- Clustering-Based Bidding Languages for Sponsored Search -- Altruism in Atomic Congestion Games -- Geometry III -- Geometric Spanners for Weighted Point Sets -- k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees -- Narrow-Shallow-Low-Light Trees with and without Steiner Points -- Algorithmic Game Theory II -- Bounded Budget Betweenness Centrality Game for Strategic Network Formations -- Exact and Approximate Equilibria for Optimal Group Network Formation -- On the Performance of Approximate Equilibria in Congestion Games -- Navigation and Routing -- Optimality and Competitiveness of Exploring Polygons by Mobile Robots -- Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links -- Dynamic vs. Oblivious Routing in Network Design -- Invited Talk -- Algorithms Meet Art, Puzzles, and Magic -- Graphs and Point Sets -- Polynomial-Time Algorithm for the Leafage of Chordal Graphs -- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases -- Shape Fitting on Point Sets with Probability Distributions -- Bioinformatics -- An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) -- Complete Parsimony Haplotype Inference Problem and Algorithms -- Linear-Time Recognition of Probe Interval Graphs -- Wireless Communications -- Wireless Scheduling with Power Control -- On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources -- Approximability of OFDMA Scheduling -- Flows, Matrices, Compression -- Maximum Flow in Directed Planar Graphs with Vertex Capacities -- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication -- On Optimally Partitioning a Text to Improve Its Compression -- Scheduling -- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling -- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling -- Preemptive Online Scheduling with Reordering -- Streaming -- d-Dimensional Knapsack in the Streaming Model -- Sparse Cut Projections in Graph Streams -- Bipartite Graph Matchings in the Semi-streaming Model -- Online Algorithms -- The Oil Searching Problem -- Hyperbolic Dovetailing -- Bluetooth and Dial a Ride -- On the Expansion and Diameter of Bluetooth-Like Topologies -- Minimum Makespan Multi-vehicle Dial-a-Ride -- Invited Talk -- Google’s Auction for TV Ads -- Decomposition and Covering -- Inclusion/Exclusion Meets Measure and Conquer -- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution -- Counting Paths and Packings in Halves -- Algorithm Engineering -- Accelerating Multi-modal Route Planning by Access-Nodes -- Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation -- Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem -- Parameterized Algorithms I -- Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth -- Kernel Bounds for Disjoint Cycles and Disjoint Paths -- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem -- Data Structures -- Rank-Pairing Heaps -- 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit -- Hash, Displace, and Compress -- Parameterized Algorithms II -- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels -- Contraction Bidimensionality: The Accurate Picture -- Minimizing Movement: Fixed-Parameter Tractability -- Hashing and Lowest Common Ancestor -- Storing a Compressed Function with Constant Time Access -- Experimental Variations of a Theoretically Good Retrieval Data Structure -- Short Labels for Lowest Common Ancestors in Trees -- Best Paper Awards -- Disproof of the Neighborhood Conjecture with Implications to SAT -- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. |
| Record Nr. | UNISA-996465672303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms - ESA 2014 [[electronic resource] ] : 22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings / / edited by Andreas S. Schulz, Dorothea Wagner
| Algorithms - ESA 2014 [[electronic resource] ] : 22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings / / edited by Andreas S. Schulz, Dorothea Wagner |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 860 p. 104 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Information storage and retrieval systems Discrete Mathematics in Computer Science Numerical Analysis Data Science Information Storage and Retrieval |
| ISBN | 3-662-44777-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design and mathematical analysis of algorithms -- Engineering -- Experimental analysis -- Real-world applications of algorithms and data structures. |
| Record Nr. | UNISA-996202527703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms - ESA 2014 : 22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings / / edited by Andreas S. Schulz, Dorothea Wagner
| Algorithms - ESA 2014 : 22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings / / edited by Andreas S. Schulz, Dorothea Wagner |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 860 p. 104 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Information storage and retrieval systems Discrete Mathematics in Computer Science Numerical Analysis Data Science Information Storage and Retrieval |
| ISBN | 3-662-44777-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design and mathematical analysis of algorithms -- Engineering -- Experimental analysis -- Real-world applications of algorithms and data structures. |
| Record Nr. | UNINA-9910483427703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms -- ESA 2011 [[electronic resource] ] : 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings / / edited by Camil Demetrescu, Magnus M. Halldorsson
| Algorithms -- ESA 2011 [[electronic resource] ] : 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings / / edited by Camil Demetrescu, Magnus M. Halldorsson |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIX, 813 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Data Science |
| ISBN | 3-642-23719-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466023103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
