2861 search results - page 187 / 573 » Constraint Programming |
103
Voted
CP
2006
Springer
15 years 6 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...
114
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...
CORR
2007
Springer
15 years 2 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...
149
Voted
SEKE
2010
Springer
15 years 1 months ago
2010
Springer
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
110
Voted
AAAI
2004
15 years 4 months ago
2004
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...