Sciweavers

1805 search results - page 198 / 361
» Functional programming with structured graphs
Sort
View
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
15 years 7 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth
ICCAD
2007
IEEE
98views Hardware» more  ICCAD 2007»
15 years 10 months ago
Device-circuit co-optimization for mixed-mode circuit design via geometric programming
Modern processing technologies offer a number of types of devices such as high-VT , low-VT , thick-oxide, etc. in addition to the nominal transistor in order to meet system perfor...
Jintae Kim, Ritesh Jhaveri, Jason Woo, Chih-Kong K...
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 7 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
LCTRTS
1998
Springer
15 years 5 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
MP
2006
90views more  MP 2006»
15 years 1 months ago
Solving multistage asset investment problems by the sample average approximation method
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
Jörgen Blomvall, Alexander Shapiro