Theory and Applications of Models of Computation : 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings / edited by T.V. Gopal, Junzo Watada.

Format:

Book

Contributor:

Gopal, T. V., editor.

Watada, J. (Junzo), editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 11436.

Theoretical Computer Science and General Issues ; 11436

Language:

English

Subjects (All):

Algorithms.

Logic, Symbolic and mathematical.

Computer science--Mathematics.

Computer science.

Numerical analysis.

Data structures (Computer science).

Algorithm Analysis and Problem Complexity.

Mathematical Logic and Formal Languages.

Discrete Mathematics in Computer Science.

Numeric Computing.

Data Structures.

Local Subjects:

Algorithm Analysis and Problem Complexity.

Mathematical Logic and Formal Languages.

Discrete Mathematics in Computer Science.

Numeric Computing.

Data Structures.

Algorithms.

Physical Description:

1 online resource (XIV, 708 pages) : 729 illustrations, 77 illustrations in color.

Edition:

First edition 2019.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2019.

System Details:

text file PDF

Summary:

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.

Contents:

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.

Other Format:

Printed edition:

ISBN:

978-3-030-14812-6

9783030148126

Access Restriction:

Restricted for use by site license.