Sciweavers

383 search results - page 4 / 77
» Common Subexpressions in Constraint Models of Planning Probl...
Sort
View
BNCOD
2006
55views Database» more  BNCOD 2006»
13 years 9 months ago
On the Optimal Ordering of Maps, Selections, and Joins Under Factorization
We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions i...
Thomas Neumann, Sven Helmer, Guido Moerkotte
AIPS
2008
13 years 10 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
ECOOP
2008
Springer
13 years 9 months ago
On Validity of Program Transformations in the Java Memory Model
Abstract. We analyse the validity of several common program transformations in multi-threaded Java, as defined by the Java Memory Model (JMM) section of Chapter 17 of the Java Lang...
Jaroslav Sevcík, David Aspinall
AAAI
1996
13 years 9 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
CSCLP
2005
Springer
14 years 1 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...