Buch, Englisch, Band 1961, 306 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 482 g
6th Asian Computing Science Conference Penang, Malaysia, November 25-27, 2000 Proceedings
Buch, Englisch, Band 1961, 306 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 482 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-41428-5
Verlag: Springer Berlin Heidelberg
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
Weitere Infos & Material
Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables.- Performance Evaluation of Networks: New Problems and Challenges.- Emerging Patterns and Classification.- IPv6 Performance Analysis on FreeBSD Workstation Using Simple Applications.- Performance of Location Caching Scheme to Support Call Locality in Wireless Networks.- A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures.- Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network.- Spatial Congruence for Ambients Is Decidable.- A Spatio-temporal Representation Scheme for Modeling Moving Objects in Video Data.- Node-to-Set Disjoint Paths Problem in Rotator Graphs.- On Simulation-Checking with Sequential Systems.- Reusing Animations in Databases for Multimedia Presentations.- Reflecting BDDs in Coq.- On Model Checking Synchronised Hardware Circuits.- Safe Ambients: Control Flow Analysis and Security.- Security Types for Mobile Safe Ambients.- Improving Functional Logic Programs by Difference-Lists.- A New Multihop Logical Topology for Reliable Broadband Communication.- A New Scalable Topology for Multihop Optical Networks.- On Computable Tree Functions.- Sharpening the Undecidability of Interval Temporal Logic.