國立虎尾科技大學 |

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Theory and Applications of Models of Computation/ edited by T.V. Gopal, Junzo Watada.
其他題名:	15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings /
其他作者:	Gopal, T.V.
面頁冊數:	XIV, 708 p. 729 illus., 77 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-14812-6
ISBN:	9783030148126

Theory and Applications of Models of Computation = 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings /
Theory and Applications of Models of Computation15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings /[electronic resource] :edited by T.V. Gopal, Junzo Watada. - 1st ed. 2019. - XIV, 708 p. 729 illus., 77 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11436. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783030148126

Standard No.: 10.1007/978-3-030-14812-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Theory and Applications of Models of Computation = 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings /
LDR:04696nam a22004095i 4500 001 1009294
003 DE-He213
005 20200705151315.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030148126 $9 978-3-030-14812-6
024 7 $a 10.1007/978-3-030-14812-6 $2 doi
035 $a 978-3-030-14812-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Theory and Applications of Models of Computation $h [electronic resource] : $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.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIV, 708 p. 729 illus., 77 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11436
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 -- 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.
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.
650 0 $a Algorithms. $3 527865
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Numerical analysis. $3 527939
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Data Structures. $3 669824
700 1 $a Gopal, T.V. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1226546
700 1 $a Watada, Junzo. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 786502
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030148119
776 0 8 $i Printed edition: $z 9783030148133
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-14812-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)