| TÃtulo : |
15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Gopal, T.V, ; Watada, Junzo, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2019 |
| Número de páginas: |
XIV, 708 p. 729 ilustraciones, 77 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-14812-6 |
| 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 TeorÃa de las máquinas Informática Matemáticas discretas Análisis numérico Inteligencia artificial Lenguajes formales y teorÃa de los autómatas Matemáticas discretas en informática Ciencia de los datos |
| Ãndice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas arbitradas de la 15.ª Conferencia Anual sobre TeorÃa y Aplicaciones de Modelos de Computación, TAMC 2019, celebrada en Kitakyushu, Japón, en abril de 2019. Los 43 artÃculos completos revisados ​​fueron cuidadosamente revisados ​​y seleccionados de 60 presentaciones. Los temas principales de los artÃculos seleccionados son computabilidad, lógica informática, complejidad, algoritmos, modelos de computación y teorÃa de sistemas. |
| Nota de contenido: |
Battery Scheduling Problem -- The Volume of a Crosspolytope Truncated by a Halfspace -- Computable Isomorphisms of Distributive Lattices -- Minmax-Regret Evacuation Planning in Cycle Networks -- Planar digraphs for automatic complexity -- Approximation Algorithms for Graph Burning -- Sublinear decoding schemes for non-adaptive group testing with inhibitors -- Compacting and Grouping Mobile Agents on Dynamic Rings -- Maximum Independent and Disjoint Coverage -- Algorithms for closed and farthest string problems via rank distance -- Computable Analysis of Linear Rearrangement Optimization -- On the power of oritatami cotranscriptional folding with unary bead sequence -- Stochastic Programming for Energy Plant Operation -- Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts -- Unshuffling permutations: Trivial bijections and compositions -- Continuous Team Semantics -- Exact Satisfiability with Jokers -- Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators -- On the Complexity of and Algorithms for Min-Max Target Coverage on a Line Boundary -- Online Travelling Salesman Problem on a Circle -- Second-order linear-time computability with applications to computable analysis -- Consistency as a Branching Time Notion -- Finite choice, convex choice and sorting -- The number of languages with maximum state complexity -- Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank -- GPU based Horn-Schunck Method to Estimate Optical Flow and Occlusion -- Robot Computing for Music Visualization -- Combinatorial Properties of Fibonacci Arrays -- Watson-Crick Jumping Finite Automata -- Dispersion of Mobile Robots: The Power of Randomness -- Building Resource Auto-Scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization -- On the Enumeration of Bicriteria Temporal Paths -- An output-sensitive algorithm for the minimization of 2-dimensional String Covers -- Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection -- Card-based Cryptography with Invisible Ink -- Read-once certificates of linear infeasibility in UTVPI constraints -- Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function -- The Complexity of Synthesis for 43 Boolean Petri Net Types -- Space Lower Bounds for Graph Stream Problems -- Bounded jump and the high/low hierarchy -- Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P -- Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management -- First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation. |
| 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 |
15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings [documento electrónico] / Gopal, T.V, ; Watada, Junzo, . - 1 ed. . - [s.l.] : Springer, 2019 . - XIV, 708 p. 729 ilustraciones, 77 ilustraciones en color. ISBN : 978-3-030-14812-6 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Algoritmos TeorÃa de las máquinas Informática Matemáticas discretas Análisis numérico Inteligencia artificial Lenguajes formales y teorÃa de los autómatas Matemáticas discretas en informática Ciencia de los datos |
| Ãndice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas arbitradas de la 15.ª Conferencia Anual sobre TeorÃa y Aplicaciones de Modelos de Computación, TAMC 2019, celebrada en Kitakyushu, Japón, en abril de 2019. Los 43 artÃculos completos revisados ​​fueron cuidadosamente revisados ​​y seleccionados de 60 presentaciones. Los temas principales de los artÃculos seleccionados son computabilidad, lógica informática, complejidad, algoritmos, modelos de computación y teorÃa de sistemas. |
| Nota de contenido: |
Battery Scheduling Problem -- The Volume of a Crosspolytope Truncated by a Halfspace -- Computable Isomorphisms of Distributive Lattices -- Minmax-Regret Evacuation Planning in Cycle Networks -- Planar digraphs for automatic complexity -- Approximation Algorithms for Graph Burning -- Sublinear decoding schemes for non-adaptive group testing with inhibitors -- Compacting and Grouping Mobile Agents on Dynamic Rings -- Maximum Independent and Disjoint Coverage -- Algorithms for closed and farthest string problems via rank distance -- Computable Analysis of Linear Rearrangement Optimization -- On the power of oritatami cotranscriptional folding with unary bead sequence -- Stochastic Programming for Energy Plant Operation -- Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts -- Unshuffling permutations: Trivial bijections and compositions -- Continuous Team Semantics -- Exact Satisfiability with Jokers -- Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators -- On the Complexity of and Algorithms for Min-Max Target Coverage on a Line Boundary -- Online Travelling Salesman Problem on a Circle -- Second-order linear-time computability with applications to computable analysis -- Consistency as a Branching Time Notion -- Finite choice, convex choice and sorting -- The number of languages with maximum state complexity -- Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank -- GPU based Horn-Schunck Method to Estimate Optical Flow and Occlusion -- Robot Computing for Music Visualization -- Combinatorial Properties of Fibonacci Arrays -- Watson-Crick Jumping Finite Automata -- Dispersion of Mobile Robots: The Power of Randomness -- Building Resource Auto-Scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization -- On the Enumeration of Bicriteria Temporal Paths -- An output-sensitive algorithm for the minimization of 2-dimensional String Covers -- Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection -- Card-based Cryptography with Invisible Ink -- Read-once certificates of linear infeasibility in UTVPI constraints -- Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function -- The Complexity of Synthesis for 43 Boolean Petri Net Types -- Space Lower Bounds for Graph Stream Problems -- Bounded jump and the high/low hierarchy -- Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P -- Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management -- First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation. |
| 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 |
|  |