17329 search results - page 3342 / 3466 » Improved non-approximability results |
183
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
150
click to vote
ICSE
1993
IEEE-ACM
15 years 10 months ago
1993
IEEE-ACM
Features are often the basic unit of development for a very large software systems and represent long-term efforts, spanning up to several years from inception to actual use. Deve...
161
click to vote
ASPLOS
1992
ACM
15 years 10 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
157
click to vote
KDD
1994
ACM
15 years 10 months ago
1994
ACM
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
166
click to vote
PLISP
1989
15 years 10 months ago
1989
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...