Electronic Resource
Springer
Acta informatica
4 (1975), S. 107-116
ISSN:
1432-0525
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Summary For Boolean functions whose variables appear in secondary storage, algorithms which minimize the expected cost of evaluation are considered. An easyto-implement algorithm which gives nearly optimal results is proposed for the case of monotonic functions without a priori probabilities. Optimality proofs are given for a simple special cases.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00288743
|
Location |
Call Number |
Expected |
Availability |