Sciweavers

11588 search results - page 138 / 2318
» Will They Like This
Sort
View
DAC
1996
ACM
14 years 2 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
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...
Hiroyuki Higuchi, Yusuke Matsunaga
CSL
1994
Springer
14 years 2 months ago
Resolution Games and Non-Liftable Resolution Orderings
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...
Hans de Nivelle
FSE
1993
Springer
148views Cryptology» more  FSE 1993»
14 years 2 months ago
Design Principles for Dedicated Hash Functions
Abstract. Dedicated hash functions are cryptographically secure compression functions which are designed specifically for hashing. They intend to form a practical alternative for ...
Bart Preneel
ICGI
1994
Springer
14 years 2 months ago
Object-Oriented Inferences in a Logical Framework for Feature Grammars
: 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,...
Liviu-Virgil Ciortuz
ISMIS
1994
Springer
14 years 2 months ago
BDDs and Automated Deduction
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....
Jean Goubault, Joachim Posegga