Theory and Applications of Models of Computation : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings
by Cai, Jin-Yi; Cooper, S. Barry; Li, AngshengFormat: Paperback
Pub. Date: 2006-06-15
Publisher(s): Springer Verlag
Other versions by this Author
List Price: $193.39
Rent Textbook
Select for Price
Rent Digital
$77.22*
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This book constitutes the refereed proceedings of the Third International Conference on Theory and Applications of Models of Computation, TAMC 2006, held in Beijing, China, in May 2006. The 75 revised full papers presented together with 7 plenary talks were carefully reviewed and selected from 319 submissions. All major areas in computer science, mathematics (especially logic) and the physical sciences particularly with regard to computation and computability theory are addressed. The papers are organized in topical sections on algorithm, computational complexity, learning theory, bioinformatics, security, formal methods, models of computation, computatability, and computable mathematics.
Table of Contents
| On-line algorithms, real time, the virtue of laziness, and the power of clairvoyance | p. 1 |
| Similarity of objects and the meaning of words | p. 21 |
| Totally < [omega][superscript [omega]] computably enumerable and m-topped degrees | p. 46 |
| Mitosis in computational complexity | p. 61 |
| Models of intuitionistic set theories over partial combinatory algebras | p. 68 |
| Width versus size in resolution proofs | p. 79 |
| Recent progress in quantum computational complexity (abstract) | p. 89 |
| On several scheduling problems with rejection or discretely compressible processing times | p. 90 |
| LS-SVM based on chaotic particle swarm optimization with simulated annealing | p. 99 |
| A bounded item bin packing problem over discrete distribution | p. 108 |
| Scheduling jobs on a flexible batching machine : model, complexity and algorithms | p. 118 |
| Faster algorithms for sorting by transpositions and sorting by block-interchanges | p. 128 |
| An ACO-based approach for task assignment and scheduling of multiprocessor control systems | p. 138 |
| Adversary immune size approximation of single-hop radio networks | p. 148 |
| On load-balanced semi-matchings for weighted bipartite graphs | p. 159 |
| Analyzing chain programs over difference constraints | p. 171 |
| Linear-time 2-approximation algorithm for the watchman route problem | p. 181 |
| Further properties of Cayley digraphs and their applications to interconnection networks | p. 192 |
| Real time critical edge of the shortest path in transportation networks | p. 198 |
| Finding min-sum disjoint shortest paths from a single source to all pairs of destinations | p. 206 |
| A new approximation algorithm for the k-facility location problem | p. 217 |
| Alternative measures of computational complexity with applications to agnostic learning | p. 231 |
| Disjoint NP-pairs from propositional proof systems | p. 236 |
| Valiant's holant theorem and matchgate tensors | p. 248 |
| Variable minimal unsatisfiability | p. 262 |
| A new lower bound of critical function for (k,s)-SAT | p. 274 |
| Cluster computing and the power of edge recognition | p. 283 |
| Quadratic lower bounds on matrix rigidity | p. 295 |
| Non-reducible descriptions for conditional Kolmogorov complexity | p. 308 |
| Generalized counters and reversal complexity | p. 318 |
| Multisource algorithmic information theory | p. 327 |
| Block sensitivity of weakly symmetric functions | p. 339 |
| Optimization problems in the polynomial-time hierarchy | p. 345 |
| #3-regular bipartite planar vertex cover is #P-complete | p. 356 |
| Group theory based synthesis of binary reversible circuits | p. 365 |
| On some complexity issues of NC analytic functions | p. 375 |
| Learning juntas in the presence of noise | p. 387 |
| Grey reinforcement learning for incomplete information processing | p. 399 |
| On the foundations of universal sequence prediction | p. 408 |
| Some recent results in U-shaped learning | p. 421 |
| Learning overcomplete representations with a generalized Gaussian prior | p. 432 |
| On PAC learning algorithms for rich Boolean function classes | p. 442 |
| On-line regression competitive with reproducing kernel Hilbert spaces | p. 452 |
| Inductive inference and language learning | p. 464 |
| Time series predictions using multi-scale support vector regressions | p. 474 |
| Identification and comparison of motifs in brain-specific and muscle-specific alternative splicing | p. 482 |
| On probe permutation graphs | p. 494 |
| Automatic classification of protein structures based on convex hull representation by integrated neural network | p. 505 |
| Protein structure comparison based on a measure of information discrepancy | p. 515 |
| Succinct text indexes on large alphabet | p. 528 |
| Identity-based threshold proxy signature scheme with known signers | p. 538 |
| Secure computations in a minimal model using multiple-valued ESOP expressions | p. 547 |
| Towards practical computable functions on context-free languages | p. 555 |
| The extended probabilistic powerdomain monad over stably compact spaces | p. 566 |
| Analysis of properties of Petri synthesis net | p. 576 |
| A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs | p. 588 |
| Object-oriented specification composition and refinement via category theoretic computations | p. 601 |
| Improved SAT based bounded model checking | p. 611 |
| Encodings and arithmetic operations in membrane computing | p. 621 |
| The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation | p. 631 |
| Forecasting black holes in abstract geometrical computation is highly unpredictable | p. 644 |
| The trade-off theorem and fragments of Godel's T | p. 654 |
| On non-binary quantum BCH codes | p. 675 |
| Maximal models of assertion graph in GSTE | p. 684 |
| Immunity properties and the n-C.E. hierarchy | p. 694 |
| On Rogers semilattices | p. 704 |
| Invertible classes | p. 707 |
| Universal cupping degrees | p. 721 |
| On the quotient structure of computably enumerable degrees modulo the noncuppable ideal | p. 731 |
| Enumeration degrees of the bounded total sets | p. 737 |
| A generic set that does not bound a minimal pair | p. 746 |
| Lowness for weakly 1-generic and Kurtz-random | p. 756 |
| On differences among elementary theories of finite levels of Ershov hierarchies | p. 765 |
| On mass problems of presentability | p. 772 |
| Beyond the first main theorem - when is the solution of a linear Cauchy problem computable? | p. 783 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.