140 search results - page 21 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
268
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
157
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
154
click to vote
JACM
2000
15 years 5 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
145
click to vote
VLDB
1995
ACM
15 years 9 months ago
1995
ACM
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...
171
click to vote
HEURISTICS
2010
15 years 3 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...