| TÃtulo : |
16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Chen, Jianer, ; Feng, Qilong, ; Xu, Jinhui, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2020 |
| Número de páginas: |
XI, 454 p. 240 ilustraciones, 33 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-59267-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: |
Algoritmos Análisis numérico Informática Matemáticas discretas Inteligencia artificial Matemáticas discretas en informática Ciencia de los datos |
| Ãndice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas arbitradas de la 16.ª Conferencia Anual sobre TeorÃa y Aplicaciones de Modelos de Computación, TAMC 2020, celebrada en Changsha, China, en octubre de 2020. Los 37 artÃculos completos fueron cuidadosamente revisados ​​y seleccionados entre 83 presentaciones. Los temas principales de los artÃculos seleccionados son la computabilidad, la complejidad, los algoritmos, la teorÃa de la información y sus extensiones a la teorÃa del aprendizaje automático y los fundamentos de la inteligencia artificial. |
| Nota de contenido: |
Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layerStochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space. |
| 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 |
16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings [documento electrónico] / Chen, Jianer, ; Feng, Qilong, ; Xu, Jinhui, . - 1 ed. . - [s.l.] : Springer, 2020 . - XI, 454 p. 240 ilustraciones, 33 ilustraciones en color. ISBN : 978-3-030-59267-7 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Algoritmos Análisis numérico Informática Matemáticas discretas Inteligencia artificial Matemáticas discretas en informática Ciencia de los datos |
| Ãndice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas arbitradas de la 16.ª Conferencia Anual sobre TeorÃa y Aplicaciones de Modelos de Computación, TAMC 2020, celebrada en Changsha, China, en octubre de 2020. Los 37 artÃculos completos fueron cuidadosamente revisados ​​y seleccionados entre 83 presentaciones. Los temas principales de los artÃculos seleccionados son la computabilidad, la complejidad, los algoritmos, la teorÃa de la información y sus extensiones a la teorÃa del aprendizaje automático y los fundamentos de la inteligencia artificial. |
| Nota de contenido: |
Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layerStochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space. |
| 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 |
|  |
Hacer una sugerencia Refinar búsqueda12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / Chen, Jianer ; Lu, Pinyan
