7092 search results - page 295 / 1419 » Parallelizing constraint programs |
88
Voted
CP
2005
Springer
15 years 8 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
146
click to vote
POPL
1998
ACM
15 years 6 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
128
click to vote
ASPLOS
2010
ACM
15 years 9 months ago
2010
ACM
With the right techniques, multicore architectures may be able to continue the exponential performance trend that elevated the performance of applications of all types for decades...
170
Voted
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
This paper introduces a programming interface called PARRAY (or Parallelizing ARRAYs) that supports system-level succinct programming for heterogeneous parallel systems like GPU c...
127
click to vote
CAMP
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— An image sensor in which each pixel has a processing element is called a vision chip. The vision chip can perform real-time visual processing at a high frame rate of 10...