SOFSEM 2001: Theory and Practice of Informatics 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Pacholski, Leszek (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Ruzicka, Peter (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2234
• Θέματα: Software engineering.; Computers.; Computer communication systems.; Artificial intelligence.; Computer science-Mathematics.; Software Engineering/Programming and Operating Systems.; Theory of Computation.; Computer Communication Networks.; Artificial Intelligence.; Mathematics of Computing.; Information Systems and Communication Service.

SOFSEM 2001, the International Conference on Current Trends in Theory and Practice of Informatics, was held on November 24 - December 1, 2001 in the ? well-known spa Pie?stany, Slovak Republic. This was the 28th annual conference in the SOFSEM series organized either in the Slovak or the Czech Repub...

Πίνακας περιεχομένων:

• Invited Talks
• The Potential of Grid, Virtual Laboratories and Virtual Organizations for Bio-sciences
• Agreement Problems in Fault-Tolerant Distributed Systems
• Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapes
• Inference in Rule-Based Systems by Interpolation and Extrapolation Revisited
• Recent Advances in Wavelength Routing
• From Metacomputing to Grid Computing: Evolution or Revolution?
• Knowledge-Based Control Systems
• Beyond the Turing Limit: Evolving Interactive Systems
• Distributed Computations by Autonomous Mobile Robots
• Formal Verification Methods for Industrial Hardware Design
• How Can Computer Science Contribute to Knowledge Discovery
• Contributed Papers
• On the Approximability of Interactive Knapsack Problems
• Model Checking Communication Protocols
• Pipelined Decomposable BSP Computers
• Quantum versus Probabilistic One-Way Finite Automata with Counter
• How to Employ Reverse Search in Distributed Single Source Shortest Paths
• Multi-agent Systems as Concurrent Constraint Processes
• ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs
• Approximative Learning of Regular Languages
• Quantum Finite State Transducers
• Lemmatizer for Document Information Retrieval Systems in JAVA
• The Reconstruction of Polyominoes from Approximately Orthogonal Projections
• Bounding Lamport's Bakery Algorithm
• Fast Independent Component Analysis in Kernel Feature Spaces
• On Majority Voting Games in Trees
• Time and Space Complexity of Reversible Pebbling
• The HiQoS Rendering System
• Two-Way Restarting Automata and J-Monotonicity
• P-Hardness of Equivalence Testing on Finite-State Processes
• Keynote Talk
• Software Geography: Physical and Economic Aspects.