805 search results - page 74 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
147
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- We consider the problem of controlling a discretetime piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over linear predi...
154
click to vote
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
137
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
170
click to vote
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
126
click to vote
CSCLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...