47 search results - page 7 / 10 » Enhancing set constraint solvers with lexicographic bounds |
ICDT
2003
ACM
14 years 20 days ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
SIGGRAPH
1999
ACM
13 years 11 months ago
1999
ACM
This paper presents a technique for adapting existing motion of a human-like character to have the desired features that are specified by a set of constraints. This problem can b...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
CP
2006
Springer
13 years 11 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...