Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Models of Computation

Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Jin-Yi Cai

    1. Computer Sciences Department, University of Wisconsin, Madison, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. S. Barry Cooper

    1. School of Mathematics, University of Leeds, Leeds, U.K.

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Angsheng Li

    1. State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3959)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TAMC 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (75 papers)

  1. Front Matter

    Download chapter PDF

  2. Plenary Lectures

    1. On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance

      • Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura
      Pages 1-20

    2. Similarity of Objects and the Meaning of Words

      • Rudi Cilibrasi, Paul Vitanyi
      Pages 21-45

    3. Totally < ω ω Computably Enumerable and m-topped Degrees

      • Rod Downey, Noam Greenberg
      Pages 46-60

    4. Mitosis in Computational Complexity

      • Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang
      Pages 61-67

    5. Models of Intuitionistic Set Theories over Partial Combinatory Algebras

      • Michael Rathjen
      Pages 68-78

    6. Width Versus Size in Resolution Proofs

      • Alasdair Urquhart
      Pages 79-88

    7. Recent Progress in Quantum Computational Complexity

      • Andrew C. Yao
      Pages 89-89

  3. Algorithm

    1. On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times

      • Zhigang Cao, Zhen Wang, Yuzhong Zhang, Shoupeng Liu
      Pages 90-98

    2. LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing

      • Ai-ling Chen, Zhi-ming Wu, Gen-ke Yang
      Pages 99-107

    3. A Bounded Item Bin Packing Problem over Discrete Distribution

      • Jianxin Chen, Yuhang Yang, Hong Zhu, Peng Zeng
      Pages 108-117

    4. Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms

      • Baoqiang Fan, Guochun Tang
      Pages 118-127

    5. Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges

      • Jianxing Feng, Daming Zhu
      Pages 128-137

    6. An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems

      • Hong Jin, Hui Wang, Hongan Wang, Guozhong Dai
      Pages 138-147

    7. Adversary Immune Size Approximation of Single-Hop Radio Networks

      • J̧edrzej Kabarowski, Mirosław Kutyłowski, Wojciech Rutkowski
      Pages 148-158

    8. On Load-Balanced Semi-matchings for Weighted Bipartite Graphs

      • Chor Ping Low
      Pages 159-170

    9. Analyzing Chain Programs over Difference Constraints

      • K. Subramani, John Argentieri
      Pages 171-180

    10. Linear-Time 2-Approximation Algorithm for the Watchman Route Problem

      • Xuehou Tan
      Pages 181-191

    11. Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks

      • Wenjun Xiao, Behrooz Parhami
      Pages 192-197

    12. Real Time Critical Edge of the Shortest Path in Transportation Networks

      • Yinfeng Xu, Huahai Yan
      Pages 198-205
Back to top

Other volumes

  1. Theory and Applications of Models of Computation

Keywords

Editors and Affiliations

  • Computer Sciences Department, University of Wisconsin, Madison, USA

    Jin-Yi Cai

  • School of Mathematics, University of Leeds, Leeds, U.K.

    S. Barry Cooper

  • State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences,  

    Angsheng Li

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation