Sciweavers

10910 search results - page 33 / 2182
» Input modeling using a computer algebra system
Sort
View
RANDOM
1998
Springer
15 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
SIGMETRICS
2003
ACM
15 years 2 months ago
Queueing systems with long-range dependent input process and subexponential service times
We analyze the asymptotic tail distribution of stationary waiting times and stationary virtual waiting times in a singleserver queue with long-range dependent arrival process and ...
Cathy H. Xia, Zhen Liu
JLP
2006
56views more  JLP 2006»
14 years 9 months ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
RTSS
1998
IEEE
15 years 1 months ago
The Time-Triggered Model of Computation
: The Time-Triggered (TT) model of computation is a model for the representation and analysis of the design of large hard real-time systems. Central to this model is the concept of...
Hermann Kopetz
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 2 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena