4007 search results - page 121 / 802 » Computation with imprecise probabilities |
123
Voted
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
108
click to vote
ICCAD
2007
IEEE
16 years 10 days ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
124
Voted
JSSPP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In order to evaluate different scheduling strategies for parallel computers, simulations are often executed. As the scheduling quality highly depends on the workload tha...
123
Voted
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
114
click to vote
FTCS
1993
15 years 4 months ago
1993
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its d...