Sciweavers

8780 search results - page 137 / 1756
» On the Feasibility of Consistent Computations
Sort
View
PARA
2004
Springer
16 years 12 days ago
New Algorithms for Statistical Analysis of Interval Data
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...
Gang Xiang, Scott A. Starks, Vladik Kreinovich, Lu...
204
Voted
ECRTS
2006
IEEE
16 years 1 months ago
Sensitivity Analysis for Fixed-Priority Real-Time Systems
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...
Enrico Bini, Marco Di Natale, Giorgio C. Buttazzo
188
Voted
AINA
2004
IEEE
15 years 10 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng
FCS
2006
15 years 8 months ago
Cryptographic and Computational Challenges in Grid Computing
A computational grid is a large-scale distributed computing environment capable of providing dependable, consistent, pervasive, and inexpensive access to high-end computational re...
Song Y. Yan, Glyn James, Gongyi Wu
205
Voted
ISMB
1993
15 years 8 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...