1161 search results - page 46 / 233 » Kinetic Dependence Graphs |
132
click to vote
IEICET
2011
14 years 7 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
116
Voted
SIGSOFT
1994
ACM
15 years 4 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
96
Voted
JETAI
1998
15 years 4 days ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
118
click to vote
SRDS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
COMPSAC
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...