968 search results - page 97 / 194 » A faster implementation of APlace |
122
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
120
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
131
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Digital halftoning, or dithering, is the technique commonly used to render a color or grayscale image on a printer, a computer monitor or other bi-level displays. A particular hal...
150
click to vote
FCT
2001
Springer
15 years 8 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
153
click to vote
DATE
2000
IEEE
15 years 8 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...