53 search results - page 5 / 11 » Automatically Exploiting Subproblem Equivalence in Constrain... |
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
AAAI
1998
14 years 10 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...
SP
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
COMPSAC
2005
IEEE
15 years 3 months ago
2005
IEEE
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
AAAI
2007
14 years 11 months ago
2007
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...