232 search results - page 46 / 47 » Completeness and Decidability in Sequence Logic |
104
click to vote
JAVA
2001
Springer
15 years 4 months ago
2001
Springer
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
112
click to vote
ICCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
104
click to vote
IJFCS
2006
14 years 11 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
148
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamenta...
116
click to vote
IEEEPACT
2005
IEEE
15 years 5 months ago
2005
IEEE
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...