4 search results - page 1 / 1 » Maintaining Arc-Consistency over Mutex Relations in Planning... |
FLAIRS
2007
13 years 7 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
PVLDB
2010
13 years 3 months ago
2010
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
EDBT
2004
ACM
14 years 5 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...