11588 search results - page 138 / 2318 » Will They Like This |
173
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
139
click to vote
CSL
1994
Springer
15 years 10 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
180
click to vote
FSE
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. Dedicated hash functions are cryptographically secure compression functions which are designed specifically for hashing. They intend to form a practical alternative for ...
138
click to vote
ICGI
1994
Springer
15 years 10 months ago
1994
Springer
: This paper deals on defining object-oriented inferences by desining a new unification procedure called ?-unification (which leads to a sound and complete resolution) in DF-logic,...
145
click to vote
ISMIS
1994
Springer
15 years 10 months ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....