Sciweavers

402 search results - page 23 / 81
» Algebraic Properties of Program Integration
Sort
View
SPAA
2006
ACM
14 years 2 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
MICRO
2010
IEEE
175views Hardware» more  MICRO 2010»
13 years 6 months ago
Efficient Selection of Vector Instructions Using Dynamic Programming
Accelerating program performance via SIMD vector units is very common in modern processors, as evidenced by the use of SSE, MMX, VSE, and VSX SIMD instructions in multimedia, scien...
Rajkishore Barik, Jisheng Zhao, Vivek Sarkar
LPNMR
1990
Springer
14 years 23 days 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
PASTE
1998
ACM
14 years 29 days ago
Concept Analysis - A New Framework for Program Understanding
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
Gregor Snelting
ISQED
2002
IEEE
128views Hardware» more  ISQED 2002»
14 years 1 months ago
Inductive Characteristics of Power Distribution Grids in High Speed Integrated Circuits
— The inductive characteristics of several types of gridded power distribution networks are described in this paper. The inductance extraction program FastHenry is used to evalua...
Andrey V. Mezhiba, Eby G. Friedman