Del 11436 i serien Lecture Notes in Computer Science

Theory and Applications of Models of Computation

15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings

Häftad, Engelska, 2019

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2019-03-07
Mått155 x 235 x 39 mm
Vikt1 077 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor708
FörlagSpringer Nature Switzerland AG
ISBN9783030148119

Tillhör följande kategorier

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.