644 search results - page 19 / 129 » Graph structured program evolution |
ICDT
1997
ACM
15 years 3 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
100
click to vote
IWPC
2000
IEEE
15 years 4 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
DAM
2006
14 years 11 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
102
click to vote
RECOMB
2005
Springer
16 years 21 hour ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...