Theory and Applications of Models of Computation Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Cai, Jin-Yi (Editor ), Cooper, Barry S. (Editor ), Li, Angsheng (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Theoretical Computer Science and General Issues, 3959
Temas:
Computer science.
Algorithms.
Artificial intelligence.
Computer science-Mathematics.
Bioinformatics.
Theory of Computation.
Artificial Intelligence.
Mathematics of Computing.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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?.

Ejemplares similares