Front matter
1-9
The Potential of Grid, Virtual Laboratories and Virtual Organizations for Bio-sciences
Hamideh Afsarmanesh, Ersin Kaletas and Louis O. Hertzberger
10-32
Agreement Problems in Fault-Tolerant Distributed Systems
Bernadette Charron-Bost
33-52
Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapes
William I. Grosky and Rong Zhao
53-57
Inference in Rule-Based Systems by Interpolation and Extrapolation Revisited
Sándor Jenei
58-72
Recent Advances in Wavelength Routing
Christos Kaklamanis
73-74
From Metacomputing to Grid Computing: Evolution or Revolution?
Domenico Laforenza
75-89
Knowledge-Based Control Systems
Simon Lambert
90-109
Beyond the Turing Limit: Evolving Interactive Systems
Jan van Leeuwen and Jiří Wiedermann
110-115
Distributed Computations by Autonomous Mobile Robots
Nicola Santoro
116-135
Formal Verification Methods for Industrial Hardware Design
Anna Slobodová
136-151
How Can Computer Science Contribute to Knowledge Discovery
Osamu Watanabe
152-159
On the Approximability of Interactive Knapsack Problems
Isto Aho
160-170
Model Checking Communication Protocols
Pablo Argón, Giorgio Delzanno, Supratik Mukhopadhyay and Andreas Podelski
171-180
Pipelined Decomposable BSP Computers
(Extended Abstract)
Martin Beran
181-190
Quantum versus Probabilistic One-Way Finite Automata with Counter
Richard Bonner, Rūsiņš Freivalds and Maksim Kravtsev
191-200
How to Employ Reverse Search in Distributed Single Source Shortest Paths
Luboš Brim, Ivana Černá, Pavel Krčál and Radek Pelánek
201-210
Multi-agent Systems as Concurrent Constraint Processes
Luboš Brim, David Gilbert, Jean-Marie Jacquet and Mojmír Křetíynskí
211-222
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs
Adriano Di Pasquale and Enrico Nardelli
223-232
Approximative Learning of Regular Languages
Henning Fernau
233-242
Quantum Finite State Transducers
Rūsinņš Freivalds and Andreas Winter
243-252
Lemmatizer for Document Information Retrieval Systems in JAVA
Leo Galambos
253-260
The Reconstruction of Polyominoes from Approximately Orthogonal Projections
Maciej Gebala
261-270
Bounding Lamport’s Bakery Algorithm
Prasad Jayanti, King Tan, Gregory Friedland and Amir Katz
271-281
Fast Independent Component Analysis in Kernel Feature Spaces
András Kocsor and János Csirik
282-291
On Majority Voting Games in Trees
Rastislav Královič
292-303
Time and Space Complexity of Reversible Pebbling
Richard Král’ovič
304-315
The HiQoS Rendering System
Tomas Plachetka, Olaf Schmidt and Frank Albracht
316-325
Two-Way Restarting Automata and J-Monotonicity
Martin Plátek
326-335
P-Hardness of Equivalence Testing on Finite-State Processes
Zdeněk Sawa and Petr Jančar
336-345
Software Geography: Physical and Economic Aspects
Vaughan R. Pratt
Back matter