2703 search results - page 235 / 541 » Optimizing memory transactions |
130
click to vote
WSC
2007
15 years 6 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
146
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
130
click to vote
JPDC
2006
15 years 4 months ago
2006
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions arising in quantum chemistry computati...
110
click to vote
DAC
1999
ACM
16 years 5 months ago
1999
ACM
Partitioning and clustering are crucial steps in circuit layout for handling large scale designs enabled by the deep submicron technologies. Retiming is an important sequential lo...
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The self-protecting multipath (SPM) is a simple protection switching mechanism that can be implemented, e.g., by MPLS. We present a linear program for the optimization of the SP...