SOFSEM 2001: Theory and Practice of Informatics
Editat de Leszek Pacholski, Peter Ruzickaen Limba Engleză Paperback – 7 noi 2001
Preț: 325.44 lei
Preț vechi: 406.80 lei
-20%
Puncte Express: 488
Preț estimativ în valută:
57.55€ • 65.99$ • 49.74£
57.55€ • 65.99$ • 49.74£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540429128
ISBN-10: 3540429123
Pagini: 364
Ilustrații: X, 350 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540429123
Pagini: 364
Ilustrații: X, 350 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras