Cover Image
Read Now

Theory and Applications of Models of Computation 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings

This book constitutes the refereed proceedings of the 15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019, held in Kitakyushu, Japan, in April 2019. The 43 revised full papers were carefully reviewed and selected from 60 submissions. The main themes of the selected...

Full description

Bibliographic Details
Other Authors: Gopal, T.V. (Editor), Watada, Junzo (Editor)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2019, 2019
Edition:1st ed. 2019
Series:Theoretical Computer Science and General Issues
Subjects:
Artificial Intelligence / Data Processing
Computer Science / Mathematics
Numerical Analysis
Discrete Mathematics In Computer Science
Algorithms
Formal Languages And Automata Theory
Machine Theory
Discrete Mathematics
Data Science
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04668nmm a2200409 u 4500
001 EB001870445
003 EBX01000000000000001033816
005 00000000000000.0
007 cr|||||||||||||||||||||
008 190802 ||| eng
020 |a 9783030148126 
100 1 |a Gopal, T.V.  |e [editor] 
245 0 0 |a Theory and Applications of Models of Computation  |h Elektronische Ressource  |b 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings  |c edited by T.V. Gopal, Junzo Watada 
250 |a 1st ed. 2019 
260 |a Cham  |b Springer International Publishing  |c 2019, 2019 
300 |a XIV, 708 p. 729 illus., 77 illus. in color  |b online resource 
505 0 |a 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 --  
505 0 |a 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 
505 0 |a 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 --  
653 |a Artificial intelligence / Data processing 
653 |a Computer science / Mathematics 
653 |a Numerical Analysis 
653 |a Discrete Mathematics in Computer Science 
653 |a Algorithms 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Numerical analysis 
653 |a Discrete mathematics 
653 |a Data Science 
700 1 |a Watada, Junzo  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-030-14812-6 
856 4 0 |u https://doi.org/10.1007/978-3-030-14812-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518.1 
520 |a This book constitutes the refereed proceedings of the 15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019, held in Kitakyushu, Japan, in April 2019. The 43 revised full papers were carefully reviewed and selected from 60 submissions. The main themes of the selected papers are computability, computer science logic, complexity, algorithms, models of computation, and systems theory 

Similar Items