7092 search results - page 347 / 1419 » Parallelizing constraint programs |
144
click to vote
IPCO
2010
15 years 27 days ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
107
click to vote
ECOOPW
1999
Springer
15 years 7 months ago
1999
Springer
Unwanted effects of aliasing cause encapsulation problems in object oriented programming. Nevertheless, aliasing is part of common and efficient programming techniques for expres...
138
click to vote
CONCUR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
SLP
1997
15 years 4 months ago
1997
We demonstrate the bene ts of instruction-set simulation in the evaluation of a parallel programming system, Penny. The simulator is a reliable tool in exploring design alternativ...
282
click to vote
ICFP
2012
ACM
13 years 5 months ago
2012
ACM
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...