1999 search results - page 12 / 400 » Finding Reductions Automatically |
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
102
click to vote
PLDI
2012
ACM
13 years 2 days ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
ICAS
2005
IEEE
15 years 3 months ago
2005
IEEE
— The purpose of this study is to maintain efficient backup routes for restoring overlay trees. In most conventional methods, after a node leaves the trees, its children start se...
WSC
1998
1998
Effective Implementation of Cycle Time Reduction Strategies for Semiconductor Back-end Manufacturing
14 years 11 months ago
Using discrete-event simulation models, a study was conducted to evaluate the current production practices of a high-volume semiconductor back-end operation. The overall goal was ...
CHI
2000
ACM
15 years 2 months ago
2000
ACM
When a novice needs help, often the best solution is to find a human expert who is capable of answering the novice’s questions. But often, novices have difficulty characterizing...