Sciweavers

417 search results - page 42 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
SAS
2001
Springer
15 years 4 months ago
Using Slicing to Identify Duplication in Source Code
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting...
Raghavan Komondoor, Susan Horwitz
SOICT
2010
14 years 6 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
JMLR
2006
153views more  JMLR 2006»
14 years 11 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis
PLDI
1994
ACM
15 years 3 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
PRDC
2006
IEEE
15 years 5 months ago
Detecting and Exploiting Symmetry in Discrete-state Markov Models
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
W. Douglas Obal II, Michael G. McQuinn, William H....