945 search results - page 73 / 189 » Incremental Branching Programs |
ICSE
2004
IEEE-ACM
14 years 9 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
AUSSOIS
2001
Springer
14 years 1 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo...
AOSD
2009
ACM
14 years 3 months ago
2009
ACM
Despite the upsurge of interest in the Aspect-Oriented Programming (AOP) paradigm, there remain few results on test data generation techniques for AOP. Furthermore, there is no wo...
SIAMJO
2008
13 years 9 months ago
2008
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...