2834 search results - page 61 / 567 » Representing Trees with Constraints |
FLAIRS
2004
13 years 10 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
ENTCS
2007
13 years 9 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
ICCAD
2003
IEEE
14 years 2 months ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
CSL
2009
Springer
14 years 25 days ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...