| 000 | 05509nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-030-14812-6 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125213.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 190305s2019 sz | s |||| 0|eng d | ||
| 020 |
_a9783030148126 _9978-3-030-14812-6 |
||
| 024 | 7 |
_a10.1007/978-3-030-14812-6 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a518.1 _223 |
| 245 | 1 | 0 |
_aTheory and Applications of Models of Computation _h[electronic resource] : _b15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings / _cedited by T.V. Gopal, Junzo Watada. |
| 250 | _a1st ed. 2019. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2019. |
|
| 300 |
_aXIV, 708 p. 729 illus., 77 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11436 |
|
| 505 | 0 | _aBattery 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 | _aThis 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 | _aAlgorithms. | |
| 650 | 0 | _aMachine theory. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aNumerical analysis. | |
| 650 | 0 |
_aArtificial intelligence _xData processing. |
|
| 650 | 1 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aNumerical Analysis. |
| 650 | 2 | 4 | _aData Science. |
| 700 | 1 |
_aGopal, T.V. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aWatada, Junzo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030148119 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030148133 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11436 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-14812-6 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c175382 _d175382 |
||