255 search results - page 27 / 51 » Generalizing Consistency and other Constraint Properties to ... |
89
Voted
SAS
1999
Springer
15 years 4 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
93
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper addresses an aspect of controllability in a single-leader network when the agents are homogeneous. In such a network, indices are not assigned to the individual agents a...
115
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
179
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
101
Voted
FLAIRS
2008
15 years 2 months ago
2008
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...