Вы здесь

Главная

вычисление

Связанные издания:

A Theoretician s View of Fault Tolerant Distributed Computing
A Time Cost Model for Distributed Objects Parallel Computation
A Tracing Protocol of Optimizing Data Parallel Irregular Computations
A Type-Based Semantics for User-Defined Marshalling in Polymorphic Languages
A Typed Process Calculus for Fine-Grained Resource Access Control to Distributed Computation
A Unified-Algebra-based Specification Language for Symbolic Computing
A Uniform Universal CREW PRAM
Authentication Service Model Supporting Multiple Domains in Distributed Computing
Automatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming
A way to logically measure synchronisation for distributed executions
Beyond Flexibility and Reflection: The Virtual Virtual Machine Approach
Bibliography for Fault-Tolerant Distributed Computing
Bloking versus Nonbloking Interprocess Communication: A Note on the Effect on concurrency
Bounded Incremental Computation
Broadening Structural Computing towards Hypermedia Development
BSP-style Computetion: A Semantic Investigation
Calculi for Interaction
Calculi for Synchrony and Asynchrony
Captures de Continuations dans un Systeme Distribue: un Dialogue Client/Serveur Symbolique
Cellular-Neural Computations: Formal Model
Cellular-Neural Computations. Formal Model and Possible Applications
Chapter 21. Runtime and Compiler Support for Irregular Computations
Characterizing Bisimulation Congruence in the -Calculus
Characterizing the Accuracy of Distributed Timestamps
Chores: Enhanced Run-Time Support for Shared-Memory Parallel Computing
Combinatorics, Complexity, and Randomness
Combinatory Models and Symbolic Computation
Communicating Evolving Algebras
Communication and Architectural Support for Network-Based Parallel Computing: Proc./First Intern. Workshop, CANPC 97. San Antonio, Texas, USA, February 1997
Communication for Alternating Machines
Communication Support for Reliable Distributed Computing
Comparing Two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm
Comparisons between CORBA and DCOM: Architectures for Distributed Computing
Comparisons of Universal Abstract Machines
Competitive Analysis of Caching in Distributed Databases
Compiler and Software Distributed Shared Memory Support for Irregular Applications
Compiler Correctness for Concurrent Languages
Complexity of Computations
Complexity of Symbolic Computing
Computability and Complexity
Computability and Decidability
Computational Science and Its Applications - ICCSA 2004, Part II: Proc./International Conference. Assisi,Italy,May 2004
Computational Science and Its Applications - ICCSA 2005. Part III: Proc./International Conference. Singapore, May 2005
Computationl Science - ICCS 2004. Part I: Proc./4th International Conference.Krakow,Poland,June 2004
Computation Models and Function Algebras
Computations in APS
Computation with Access to the Reals, but Using only Classical Machines
Computing 3-valued Stable Models by using the ATMS
Computing Average Path Lengths of Binary Search Trees
Computing in the 90 s: Proc./The First Great Lakes Computer Conf., Kalamazoo, Michigan, USA, October 1989