Vai al contenuto principale della pagina

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



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: 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 Visualizza cluster
Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Edizione: 1st ed. 2018.
Descrizione fisica: 1 online resource (VIII, 320 p. 77 illus., 31 illus. in color.)
Disciplina: 005.1
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
Persona (resp. second.): TangShaojie
DuDing-Zhu
WoodruffDavid
ButenkoSergiy
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.
Sommario/riassunto: This volume constitutes the proceedings of the 12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018, held in Dallas, Texas, USA, in December 2018. The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
Titolo autorizzato: Algorithmic Aspects in Information and Management  Visualizza cluster
ISBN: 3-030-04618-4
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996466280403316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 11343