top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Algorithmic Aspects in Information and Management [[electronic resource] ] : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / / edited by Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko
Algorithmic Aspects in Information and Management [[electronic resource] ] : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / / edited by Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (VIII, 320 p. 77 illus., 31 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Numerical analysis
Artificial intelligence
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Numerical Analysis
Artificial Intelligence
Data Science
ISBN 3-030-04618-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Minimum Diameter $k$-Steiner Forest -- Factors Impacting the Label Denoising of Neural Relation Extraction -- Makespan Minimization on Unrelated Parallel Machines with a Few Bags -- Channel Assignment with r-Dynamic Coloring -- Profit Maximization Problem with Coupons in Social Networks -- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem -- A Novel Approach to Verifying Context Free Properties of Programs -- Determination of Dual Distances for a Kind of Perfect Mixed Codes -- Approximation and Competitive Algorithms for Single-Minded Selling Problem -- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints -- Quality-aware Online Task Assignment Using Latent Topic Model -- Calibration Scheduling with Time Slot Cost -- The k-power domination problem in weighted trees -- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach -- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network -- Faster Compression of Patterns to Rectangle Rule Lists -- Algorithm Designs for Dynamic Ridesharing System -- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems -- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces -- Order preserving barrier coverage with weighted sensors on a line -- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing -- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem -- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory -- Community-based Acceptance Probability Maximization for Target Users on Social Networks -- Knowledge Graph Embedding Based on Subgraph-aware Proximity.
Record Nr. UNINA-9910349391603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
Algorithmic Aspects in Information and Management [[electronic resource] ] : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIV, 223 p. 36 illus.)
Disciplina 004.071
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Pattern recognition systems
Computer networks
Discrete Mathematics in Computer Science
Data Science
Automated Pattern Recognition
Computer Communication Networks
ISBN 3-319-41168-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Item Pricing for Combinatorial Public Projects -- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves -- On the Complexity of Clustering with Relaxed Size Constraints -- Superstring Graph: A New Approach for Genome Assembly -- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees -- A Very Fast String Matching Algorithm Based on Condensed Alphabets -- Minimum-Density Identifying Codes in Square Grids -- Separating Codes and Traffic Monitoring -- Know When to Persist: Deriving Value from a Stream Buffer -- Algorithmic Aspects of Upper Domination: A Parameterised Perspective -- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games -- Parameterized Complexity of Team Formation in Social Networks -- Reconstructing Cactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithms for the Order Preserving Pattern Matching Problem -- Computing the Line-Constrained k-Center in the Plane for Small k -- Online k-max Search Algorithm with Applications to the Secretary Problem.
Record Nr. UNISA-996465958503316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
Algorithmic Aspects in Information and Management [[electronic resource] ] : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIV, 223 p. 36 illus.)
Disciplina 004.071
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Pattern recognition systems
Computer networks
Discrete Mathematics in Computer Science
Data Science
Automated Pattern Recognition
Computer Communication Networks
ISBN 3-319-41168-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Item Pricing for Combinatorial Public Projects -- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves -- On the Complexity of Clustering with Relaxed Size Constraints -- Superstring Graph: A New Approach for Genome Assembly -- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees -- A Very Fast String Matching Algorithm Based on Condensed Alphabets -- Minimum-Density Identifying Codes in Square Grids -- Separating Codes and Traffic Monitoring -- Know When to Persist: Deriving Value from a Stream Buffer -- Algorithmic Aspects of Upper Domination: A Parameterised Perspective -- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games -- Parameterized Complexity of Team Formation in Social Networks -- Reconstructing Cactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithms for the Order Preserving Pattern Matching Problem -- Computing the Line-Constrained k-Center in the Plane for Small k -- Online k-max Search Algorithm with Applications to the Secretary Problem.
Record Nr. UNINA-9910484147203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings / / edited by Qianping Gu, Pavol Hell, Boting Yang
Algorithmic Aspects in Information and Management [[electronic resource] ] : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings / / edited by Qianping Gu, Pavol Hell, Boting Yang
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XVI, 342 p. 83 illus.)
Disciplina 006.31
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Data Science
ISBN 3-319-07956-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996199995203316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings / / edited by Qianping Gu, Pavol Hell, Boting Yang
Algorithmic Aspects in Information and Management [[electronic resource] ] : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings / / edited by Qianping Gu, Pavol Hell, Boting Yang
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XVI, 342 p. 83 illus.)
Disciplina 006.31
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Data Science
ISBN 3-319-07956-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910483690203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20–21, 2018, Revised Selected Papers / / edited by Yann Disser, Vassilios S. Verykios
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20–21, 2018, Revised Selected Papers / / edited by Yann Disser, Vassilios S. Verykios
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XII, 183 p. 48 illus., 29 illus. in color.)
Disciplina 004.6782
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Application software
Database management
Computer science—Mathematics
Discrete mathematics
Computer arithmetic and logic units
Artificial intelligence—Data processing
Computer and Information Systems Applications
Database Management
Discrete Mathematics in Computer Science
Arithmetic and Logic Structures
Data Science
ISBN 3-030-19759-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Minimization of Testing Costs in Capacity-Constrained Database Migration -- Community Detection via Neighborhood Overlap and Spanning Tree Computations -- Colocation, Colocation, Colocation: Optimizing Placement in the Hybrid Cloud -- A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension -- A Fully Polynomial Time Approximation Scheme for Packing While Traveling -- Multi-Commodity Flow with In-Network Processing -- On-line Big‒Data Processing for Visual Analytics with Argus-Panoptes -- An Overview of Big Data Issues in Privacy-Preserving Record Linkage -- Web Frameworks Metrics for Data Handling and Visualization -- Algorithms for Cloud-based Smart Mobility -- A Frequent Itemset Hiding Toolbox.
Record Nr. UNISA-996466207803316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20–21, 2018, Revised Selected Papers / / edited by Yann Disser, Vassilios S. Verykios
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20–21, 2018, Revised Selected Papers / / edited by Yann Disser, Vassilios S. Verykios
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XII, 183 p. 48 illus., 29 illus. in color.)
Disciplina 004.6782
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Application software
Database management
Computer science—Mathematics
Discrete mathematics
Computer arithmetic and logic units
Artificial intelligence—Data processing
Computer and Information Systems Applications
Database Management
Discrete Mathematics in Computer Science
Arithmetic and Logic Structures
Data Science
ISBN 3-030-19759-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Minimization of Testing Costs in Capacity-Constrained Database Migration -- Community Detection via Neighborhood Overlap and Spanning Tree Computations -- Colocation, Colocation, Colocation: Optimizing Placement in the Hybrid Cloud -- A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension -- A Fully Polynomial Time Approximation Scheme for Packing While Traveling -- Multi-Commodity Flow with In-Network Processing -- On-line Big‒Data Processing for Visual Analytics with Argus-Panoptes -- An Overview of Big Data Issues in Privacy-Preserving Record Linkage -- Web Frameworks Metrics for Data Handling and Visualization -- Algorithms for Cloud-based Smart Mobility -- A Frequent Itemset Hiding Toolbox.
Record Nr. UNINA-9910337839803321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
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. UNINA-9910349261303321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : First International Workshop, ALGOCLOUD 2015, Patras, Greece, September 14-15, 2015. Revised Selected Papers / / edited by Ioannis Karydis, Spyros Sioutas, Peter Triantafillou, Dimitrios Tsoumakos
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : First International Workshop, ALGOCLOUD 2015, Patras, Greece, September 14-15, 2015. Revised Selected Papers / / edited by Ioannis Karydis, Spyros Sioutas, Peter Triantafillou, Dimitrios Tsoumakos
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIV, 193 p. 49 illus. in color.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Machine theory
Artificial intelligence
Computer science—Mathematics
Discrete mathematics
Computer Science Logic and Foundations of Programming
Software Engineering
Formal Languages and Automata Theory
Artificial Intelligence
Discrete Mathematics in Computer Science
ISBN 3-319-29919-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Tutorials -- Algorithmic Aspects of Large-Scale Data Stores -- Software Tools and Distributed Architectures for Cloud-based Data Management.
Record Nr. UNISA-996466000203316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui