1225 search results - page 128 / 245 » The Instance Complexity Conjecture |
ADC
2000
Springer
14 years 1 months ago
2000
Springer
Workflow technology has emerged as an appropriate platform for consolidating the distributed information resources of an enterprise, promoting interoperability across cross-platfo...
IFL
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Most array operations in Sac are specified in terms of so-called withloops, a Sac-specific form of array comprehension. Due to the map-like semantics of with-loops its ...
IPPS
1996
IEEE
14 years 1 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
IWPC
1996
IEEE
14 years 1 months ago
1996
IEEE
Mastering the complexity of programs and systems, particularly distributed systems, should lead to signi cant improvements in program and system understanding. In this paper we pr...
LOPSTR
1997
Springer
14 years 1 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...