8132 search results - page 230 / 1627 » Dependability, Abstraction, and Programming |
172
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
208
click to vote
ECRTS
2002
IEEE
15 years 11 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
177
click to vote
ICPP
1996
IEEE
15 years 10 months ago
1996
IEEE
The ability to automatically parallelize standard programming languages results in program portability across a wide range of machine architectures. It is the goal of the Polaris ...
185
click to vote
DMIN
2006
15 years 8 months ago
2006
Clustering is the process of locating patterns in large data sets. It is an active research area that provides value to scientific as well as business applications. Practical clust...
186
click to vote
AMAST
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...