Jin yi cai (19 Ergebnisse)

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics, COCOON '96, held in June 1996 in Hong Kong.The 44 papers presented in the book in revised version were carefully selected from a total of 82 submissions. They describe state-of-the-art research results from various areas of theoretical computer science, combinatorics related to computing, and experimental analysis of algorithms; computational graph theory, computational geometry, and networking issues are particularly well-presented.…

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: Brand New. 209 pages. 10.25x7.25x0.50 inches. In Stock.

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Theory and Applications of Models of Computation | 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings | Jin-Yi Cai (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2007 | Springer | EAN 9783540725039 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007, held in Shanghai, China in May 2007. It addresses all major areas in computer science; mathematics, especially logic; and the physical sciences, particularly with regard to computation and computability theory. The papers particularly focus on algorithms, complexity and computability theory.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 CriticalFunction 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 CompactSpaces.- 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 Anal.…

Zustand: Used. pp. 470.

Paperback. Zustand: Brand New. 1st edition. 772 pages. 9.00x6.00x1.00 inches. In Stock.

Zustand: Used. pp. 470.

Zustand: New. In English.

Zustand: New. Presents a collection of papers on computational complexity theory grew out of activities during a special year at DIMACS. This work is suitable for researchers in complexity theory and graduate students in mathematics or computer science. Editor(s): Jin-Yi Cai. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 209 pages, illustrations. BIC Classification: PBK; UY. Category: (P) Professional & Vocational. Dimension: 260 x 184. Weight in Grams: 624. . 1993. hardcover. . . . . Books ship from the US and Ireland.…

Zustand: New. In English.

Zustand: New. 2017. 1st Edition. hardcover. . . . . . Books ship from the US and Ireland.