Sciweavers

856 search results - page 58 / 172
» Dependent Types in Practical Programming
Sort
View
RANDOM
1998
Springer
14 years 28 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
SMI
2005
IEEE
14 years 2 months ago
Subdomain Aware Contour Trees and Contour Evolution in Time-Dependent Scalar Fields
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
Andrzej Szymczak
ENTCS
2006
122views more  ENTCS 2006»
13 years 8 months ago
Combining Aspect-Oriented and Strategic Programming
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
Karl Trygve Kalleberg, Eelco Visser
IEEEPACT
1998
IEEE
14 years 1 months ago
Exploiting Method-Level Parallelism in Single-Threaded Java Programs
Method speculation of object-oriented programs attempts to exploit method-level parallelism (MLP) by executing sequential method invocations in parallel, while still maintaining c...
Michael K. Chen, Kunle Olukotun
RTSS
1998
IEEE
14 years 1 months ago
Practical Solutions for QoS-Based Resource Allocation
Abstract: The QoS-based Resource Allocation Model (QRAM) proposed in [20] presented an analytical approach for satisfying multiple quality-of-service dimensions in a resource-const...
Ragunathan Rajkumar, Chen Lee, John P. Lehoczky, D...