Sciweavers

4763 search results - page 125 / 953
» On the Execution of Deep Models
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
14 years 12 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
ICECCS
2005
IEEE
89views Hardware» more  ICECCS 2005»
15 years 5 months ago
A Tool-Supported Approach to Testing UML Design Models
For Model Driven Development approaches to succeed, there is a need for model validation techniques. This paper presents an approach to testing designs described by UML class diag...
Trung T. Dinh-Trong, Nilesh Kawane, Sudipto Ghosh,...
HPCA
2004
IEEE
16 years 5 days ago
Reducing Branch Misprediction Penalty via Selective Branch Recovery
Branch misprediction penalty consists of two components: the time wasted on mis-speculative execution until the mispredicted branch is resolved and the time to restart the pipelin...
Amit Gandhi, Haitham Akkary, Srikanth T. Srinivasa...
PPOPP
1999
ACM
15 years 4 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
JCC
2008
125views more  JCC 2008»
14 years 11 months ago
Efficient electronic integrals and their generalized derivatives for object oriented implementations of electronic structure cal
: For the new parallel implementation of electronic structure methods in ACES III (Lotrich et al., in preparation) the present state-of-the-art algorithms for the evaluation of ele...
Norbert Flocke, Victor Lotrich