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)
Algorithm Theory -- SWAT 2014 [[electronic resource] ] : 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings / / edited by Inge Li Gørtz, R. Ravi
Algorithm Theory -- SWAT 2014 [[electronic resource] ] : 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings / / edited by Inge Li Gørtz, R. Ravi
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XX, 394 p. 39 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Data Science
ISBN 3-319-08404-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Online Makespan Minimization with Parallel Schedules -- Expected Linear Time Sorting for Word Size Ω(log2 n log log n) -- Amortized Analysis of Smooth Quadtrees in All Dimensions -- New Approximability Results for the Robust k-Median Problem -- Approximating the Revenue Maximization Problem with Sharp Demands -- Reconfiguring Independent Sets in Claw-Free Graphs -- Competitive Online Routing on Delaunay Triangulations -- Optimal Planar Orthogonal Skyline Counting Queries -- B-slack Trees: Space Efficient B-Trees -- Approximately Minwise Independence with Twisted Tabulation -- Colorful Bin Packing -- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques -- Win-Win Kernelization for Degree Sequence Completion Problems -- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem -- Covering Problems in Edge- and Node-Weighted Graphs -- Colored Range Searching in Linear Space -- Fast Dynamic Graph Algorithms for Parameterized Problems -- Extending Partial Representations of Proper and Unit Interval Graphs -- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams -- Approximate Counting of Matchings in (3,3)-Hypergraphs.
Record Nr. UNINA-9910484944503321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (XIII, 438 p.)
Disciplina 005.73
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence—Data processing
Discrete mathematics
Algorithms
Computer networks
Computer science—Mathematics
Computer graphics
Data Science
Discrete Mathematics
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-69903-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation.
Record Nr. UNISA-996465379903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (XIII, 438 p.)
Disciplina 005.73
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence—Data processing
Discrete mathematics
Algorithms
Computer networks
Computer science—Mathematics
Computer graphics
Data Science
Discrete Mathematics
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-69903-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation.
Record Nr. UNINA-9910484732303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings / / edited by Weili Wu, Hongwei Du
Algorithmic Aspects in Information and Management [[electronic resource] ] : 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings / / edited by Weili Wu, Hongwei Du
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (456 pages)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science - Mathematics
Discrete mathematics
Computer science
Image processing - Digital techniques
Computer vision
Data structures (Computer science)
Information theory
Numerical analysis
Discrete Mathematics in Computer Science
Theory of Computation
Computer Imaging, Vision, Pattern Recognition and Graphics
Data Structures and Information Theory
Numerical Analysis
ISBN 3-030-93176-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.
Record Nr. UNINA-9910513582803321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings / / edited by Weili Wu, Hongwei Du
Algorithmic Aspects in Information and Management [[electronic resource] ] : 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings / / edited by Weili Wu, Hongwei Du
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (456 pages)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science - Mathematics
Discrete mathematics
Computer science
Image processing - Digital techniques
Computer vision
Data structures (Computer science)
Information theory
Numerical analysis
Discrete Mathematics in Computer Science
Theory of Computation
Computer Imaging, Vision, Pattern Recognition and Graphics
Data Structures and Information Theory
Numerical Analysis
ISBN 3-030-93176-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.
Record Nr. UNISA-996464415803316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du
Algorithmic Aspects in Information and Management [[electronic resource] ] : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XI, 640 p. 151 illus., 61 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Data structures (Computer science)
Information theory
Data mining
Discrete Mathematics in Computer Science
Data Structures and Information Theory
Data Mining and Knowledge Discovery
ISBN 3-030-57602-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-rounding plus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selfish Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs with large girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree.
Record Nr. UNISA-996418321103316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du
Algorithmic Aspects in Information and Management [[electronic resource] ] : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XI, 640 p. 151 illus., 61 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Data structures (Computer science)
Information theory
Data mining
Discrete Mathematics in Computer Science
Data Structures and Information Theory
Data Mining and Knowledge Discovery
ISBN 3-030-57602-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-rounding plus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selfish Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs with large girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree.
Record Nr. UNINA-9910416082603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang
Algorithmic Aspects in Information and Management [[electronic resource] ] : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (IX, 354 p. 67 illus., 9 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Numerical analysis
Algorithms
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Numerical Analysis
Data Science
ISBN 3-030-27195-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling -- Profit Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Influence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem.
Record Nr. UNISA-996466449703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Aspects in Information and Management [[electronic resource] ] : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang
Algorithmic Aspects in Information and Management [[electronic resource] ] : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (IX, 354 p. 67 illus., 9 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Numerical analysis
Algorithms
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Numerical Analysis
Data Science
ISBN 3-030-27195-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling -- Profit Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Influence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem.
Record Nr. UNINA-9910349308403321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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. UNISA-996466280403316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui