Sciweavers

68 search results - page 4 / 14
» Realizability algebras: a program to well order R
Sort
View
WSC
2000
13 years 8 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
ICCCN
2007
IEEE
14 years 1 months ago
Lagniappe: Multi-* Programming Made Simple
—The emergence of multi-processor, multi-threaded architectures (referred to as multi- architectures) facilitates the design of high-throughput request processing systems (e.g., ...
Taylor L. Riché, R. Greg Lavender, Harrick ...
SC
2009
ACM
14 years 2 months ago
Scalable temporal order analysis for large scale debugging
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...
PLDI
2003
ACM
14 years 20 days ago
Linear analysis and optimization of stream programs
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
Andrew A. Lamb, William Thies, Saman P. Amarasingh...