284 search results - page 46 / 57 » On Reversible Combinatory Logic |
FPL
2003
Springer
14 years 3 months ago
2003
Springer
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
IDEAS
2002
IEEE
14 years 2 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
ISSAC
1997
Springer
14 years 1 months ago
1997
Springer
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
DSN
2004
IEEE
14 years 1 months ago
2004
IEEE
A result checker is a program that checks the output of the computation of the observed program for correctness. Introduced originally by Blum, the result checking paradigm has pr...
AAAI
1990
13 years 11 months ago
1990
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...