Sciweavers

1024 search results - page 183 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
152
Voted
CP
2005
Springer
15 years 12 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
164
Voted
ASPLOS
2010
ACM
16 years 1 months ago
Flexible architectural support for fine-grain scheduling
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
Daniel Sanchez, Richard M. Yoo, Christos Kozyrakis
207
Voted
JSW
2008
101views more  JSW 2008»
15 years 6 months ago
Graphical Mission Specification and Partitioning for Unmanned Underwater Vehicles
- The use of Unmanned Underwater Vehicles (UUVs) has been proposed for several different types of applications including hydrographic surveys (e.g., mapping the ocean floor and exp...
Gary Giger, Mahmut T. Kandemir, John Dzielski
176
Voted
ASPLOS
2009
ACM
15 years 10 months ago
Accelerating phase unwrapping and affine transformations for optical quadrature microscopy using CUDA
Optical Quadrature Microscopy (OQM) is a process which uses phase data to capture information about the sample being studied. OQM is part of an imaging framework developed by the ...
Perhaad Mistry, Sherman Braganza, David R. Kaeli, ...
255
Voted
TOG
2012
230views Communications» more  TOG 2012»
13 years 8 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...