7092 search results - page 421 / 1419 » Parallelizing constraint programs |
151
Voted
AGP
1999
IEEE
15 years 7 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
112
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
123
Voted
AAAI
1998
15 years 4 months ago
1998
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...
100
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
102
Voted
SIAMJO
2008
15 years 3 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...