500 search results - page 8 / 100 » Procedure Placement Using Temporal Ordering Information |
TAPSOFT
1995
Springer
14 years 1 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
KBSE
1997
IEEE
14 years 2 months ago
1997
IEEE
Legacy software systems present a high level of entropy combined with imprecise documentation. This makes their maintenance more difficult, more time consuming, and costlier. In o...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
IANDC
2007
13 years 9 months ago
2007
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...