1096 search results - page 92 / 220 » Computation Slicing: Techniques and Theory |
DAC
2005
ACM
14 years 10 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
VISUALIZATION
2003
IEEE
14 years 2 months ago
2003
IEEE
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
SIGMETRICS
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...