1415 search results - page 85 / 283 » Can Parallel Algorithms Enhance Serial Implementation |
130
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
150
click to vote
FAST
2004
15 years 3 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
ICMCS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we propose power efficient motion estimation (ME) using multiple imprecise sum absolute difference (SAD) metric computations. We extend recent work in [18] by prov...
130
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
132
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...