68 search results - page 10 / 14 » Constraint Satisfaction for Relative Location Assignment and... |
AAAI
1997
14 years 11 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
RTSS
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper presents a comprehensive design methodology for guaranteeing end-to-end requirements of real-time systems. Applications are structured as a set of process components co...
KI
2002
Springer
14 years 9 months ago
2002
Springer
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
116
click to vote
PODS
1999
ACM
15 years 1 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...