3148 search results - page 251 / 630 » On the Dynamic Initialization of Parallel Computers |
146
click to vote
CCO
2001
Springer
15 years 8 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...
163
click to vote
TVCG
2011
14 years 11 months ago
2011
—We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds...
137
Voted
ISPASS
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract—We generate and provide miniature synthetic benchmark clones for modern workloads to solve two pre-silicon design challenges, namely: 1) huge simulation time (weeks to m...
127
click to vote
CVPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
148
Voted
EMSOFT
2008
Springer
15 years 5 months ago
2008
Springer
Aimed at verifying safety properties and improving simulation coverage for hybrid systems models of embedded control software, we propose a technique that combines numerical simul...