4469 search results - page 33 / 894 » Dynamic Program Slicing |
NIPS
2008
13 years 9 months ago
2008
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
SIGSOFT
1994
ACM
13 years 11 months ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
STVR
2002
13 years 7 months ago
2002
This paper describes the use of conditioned slicing to assist partition testing, illustrating this with a case study. The paper shows how a conditioned slicing tool can be used to...
PASTE
2004
ACM
14 years 1 months ago
2004
ACM
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
FLAIRS
2003
13 years 9 months ago
2003
We extend the differential approach to inference in Bayesian networks (BNs) (Darwiche, 2000) to handle specific problems that arise in the context of dynamic Bayesian networks (D...