Sciweavers

804 search results - page 42 / 161
» On the Termination of the Chase Algorithm
Sort
View
81
Voted
ICFP
2008
ACM
16 years 13 days ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
FROCOS
2007
Springer
15 years 6 months ago
Temporal Logic with Capacity Constraints
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
Clare Dixon, Michael Fisher, Boris Konev
92
Voted
ICOIN
2004
Springer
15 years 5 months ago
Performance of New Broadcast Forwarding Criteria in MANET
In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce...
Lijuan Zhu, Bu-Sung Lee, Boon-Chong Seet, Kai Juan...
104
Voted
CONCUR
2003
Springer
15 years 5 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski
94
Voted
ICONIP
1998
15 years 1 months ago
An Application of ELISA to Perfect Hashing with Deterministic Ordering
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
Monica Bianchini, Stefano Fanelli, Marco Gori