|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-34022-5 |
| 003 |
DE-He213 |
| 005 |
20230406054440.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100421s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540340225
|9 978-3-540-34022-5
|
| 024 |
7 |
|
|a 10.1007/11750321
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Theory and Applications of Models of Computation
|h [electronic resource] :
|b Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings /
|c edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XVI, 800 p.
|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,
|x 2512-2029 ;
|v 3959
|
| 505 |
0 |
|
|a Plenary Lectures -- On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance -- Similarity of Objects and the Meaning of Words -- Totally ? ? Computably Enumerable and m-topped Degrees -- Mitosis in Computational Complexity -- Models of Intuitionistic Set Theories over Partial Combinatory Algebras -- Width Versus Size in Resolution Proofs -- Recent Progress in Quantum Computational Complexity -- Algorithm -- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times -- LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing -- A Bounded Item Bin Packing Problem over Discrete Distribution -- Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms -- Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges -- An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems -- Adversary Immune Size Approximation of Single-Hop Radio Networks -- On Load-Balanced Semi-matchings for Weighted Bipartite Graphs -- Analyzing Chain Programs over Difference Constraints -- Linear-Time 2-Approximation Algorithm for the Watchman Route Problem -- Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks -- Real Time Critical Edge of the Shortest Path in Transportation Networks -- Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations -- A New Approximation Algorithm for the k-Facility Location Problem -- Computational Complexity -- Alternative Measures of Computational Complexity with Applications to Agnostic Learning -- Disjoint NP-Pairs from Propositional Proof Systems -- Valiant's Holant Theorem and Matchgate Tensors -- Variable Minimal Unsatisfiability -- A New Lower Bound of Critical Function for (k,s)-SAT -- Cluster Computing and the Power of Edge Recognition -- Quadratic Lower Bounds on Matrix Rigidity -- Non-reducible Descriptions for Conditional Kolmogorov Complexity -- Generalized Counters and Reversal Complexity -- Multisource Algorithmic Information Theory -- Block Sensitivity of Weakly Symmetric Functions -- Optimization Problems in the Polynomial-Time Hierarchy -- #3-Regular Bipartite Planar Vertex Cover is #P-Complete -- Group Theory Based Synthesis of Binary Reversible Circuits -- On Some Complexity Issues of NC Analytic Functions -- Learning Theory -- Learning Juntas in the Presence of Noise -- Grey Reinforcement Learning for Incomplete Information Processing -- On the Foundations of Universal Sequence Prediction -- Some Recent Results in U-Shaped Learning -- Learning Overcomplete Representations with a Generalized Gaussian Prior -- On PAC Learning Algorithms for Rich Boolean Function Classes -- On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces -- Inductive Inference and Language Learning -- Time Series Predictions Using Multi-scale Support Vector Regressions -- Bioinformatics -- Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing -- On Probe Permutation Graphs -- Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network -- Protein Structure Comparison Based on a Measure of Information Discrepancy -- Succinct Text Indexes on Large Alphabet -- Security -- Identity-Based Threshold Proxy Signature Scheme with Known Signers -- Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions -- Formal Method -- Towards Practical Computable Functions on Context-Free Languages -- The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces -- Analysis of Properties of Petri Synthesis Net -- A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs -- Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations -- Improved SAT Based Bounded Model Checking -- Models of Computation -- Encodings and Arithmetic Operations in Membrane Computing -- The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation -- Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable -- The Trade-Off Theorem and Fragments of Gödel's T -- On Non-binary Quantum BCH Codes -- Maximal Models of Assertion Graph in GSTE -- Computatability -- Immunity Properties and the n-C.E. Hierarchy -- On Rogers Semilattices -- Invertible Classes -- Universal Cupping Degrees -- On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal -- Enumeration Degrees of the Bounded Total Sets -- A Generic Set That Does Not Bound a Minimal Pair -- Lowness for Weakly 1-generic and Kurtz-Random -- On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies -- Computable Mathematics -- On Mass Problems of Presentability -- Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Bioinformatics.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Bioinformatics.
|
| 700 |
1 |
|
|a Cai, Jin-Yi.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Cooper, Barry S.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Li, Angsheng.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540823605
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540340218
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3959
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11750321
|z Texto Completo
|
| 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)
|
