53 search results - page 3 / 11 » Automatically Exploiting Subproblem Equivalence in Constrain... |
CSCLP
2006
Springer
13 years 9 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
ACSAC
2007
IEEE
13 years 11 months ago
2007
IEEE
Understanding security bugs in a vulnerable program is a non-trivial task, even if the target program is known to be vulnerable. Though there exist debugging tools that facilitate...
IPCO
2008
13 years 6 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
ASAP
1997
IEEE
13 years 9 months ago
1997
IEEE
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
JFP
2000
13 years 5 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...