2642 search results - page 322 / 529 » Merge-by-Wire: Algorithms and System Support |
135
click to vote
RTSS
1998
IEEE
15 years 8 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
139
click to vote
EDBT
2010
ACM
15 years 7 months ago
2010
ACM
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
161
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
166
click to vote
POPL
2011
ACM
14 years 6 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
122
click to vote
ASM
2004
ASM
15 years 9 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...