Sciweavers

484 search results - page 32 / 97
» Caching function calls using precise dependencies
Sort
View
HPCA
1998
IEEE
14 years 2 months ago
Performance Study of a Concurrent Multithreaded Processor
The performance of a concurrent multithreaded architectural model, called superthreading 15 , is studied in this paper. It tries to integrate optimizing compilation techniques and...
Jenn-Yuan Tsai, Zhenzhen Jiang, Eric Ness, Pen-Chu...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
IFIP12
2008
13 years 11 months ago
Optimizing Relationships Information in Repertory Grids
The Repertory Grid method is widely used in knowledge engineering to infer functional relationships between constructs given by an expert. The method is ignoring information that c...
Enrique Calot, Paola Britos, Ramón Garc&iac...
ENTCS
2007
103views more  ENTCS 2007»
13 years 9 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
13 years 10 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas