12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / Tang, Shaojie ; Du, Ding-Zhu ; Woodruff, David ; Butenko, Sergiy  

Público ISBD Ningún comentario para este registro. Título : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings Tipo de documento: documento electrónico Autores: Tang, Shaojie, ; Du, Ding-Zhu, ; Woodruff, David, ; Butenko, Sergiy, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2018 Número de páginas: VIII, 320 p. 77 ilustraciones, 31 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-04618-7 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Palabras clave: Informática  Matemáticas discretas  Algoritmos  Análisis numérico  Inteligencia artificial  Matemáticas discretas en informática  Ciencia de los datos Índice Dewey: 40.151 Resumen: Este volumen constituye las actas de la 12.ª Conferencia Internacional sobre Aspectos Algorítmicos en la Información y la Gestión, AAIM 2018, celebrada en Dallas, Texas, EE. UU., en diciembre de 2018. Los 25 artículos completos presentados fueron cuidadosamente revisados ​​y seleccionados. Los artículos abordan las tendencias actuales de investigación sobre algoritmos, estructuras de datos, investigación operativa, optimización combinatoria y sus aplicaciones. Nota de contenido: 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. En línea: https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Link: https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings [documento electrónico] / Tang, Shaojie, ; Du, Ding-Zhu, ; Woodruff, David, ; Butenko, Sergiy,  . -  1 ed.  . - [s.l.] : Springer, 2018 . - VIII, 320 p. 77 ilustraciones, 31 ilustraciones en color. ISBN : 978-3-030-04618-7 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Palabras clave: Informática  Matemáticas discretas  Algoritmos  Análisis numérico  Inteligencia artificial  Matemáticas discretas en informática  Ciencia de los datos Índice Dewey: 40.151 Resumen: Este volumen constituye las actas de la 12.ª Conferencia Internacional sobre Aspectos Algorítmicos en la Información y la Gestión, AAIM 2018, celebrada en Dallas, Texas, EE. UU., en diciembre de 2018. Los 25 artículos completos presentados fueron cuidadosamente revisados ​​y seleccionados. Los artículos abordan las tendencias actuales de investigación sobre algoritmos, estructuras de datos, investigación operativa, optimización combinatoria y sus aplicaciones. Nota de contenido: 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. En línea: https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Link: https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i

---

1 (1 - 1 / 1) Par page : 25 50 100 200