6598 search results - page 204 / 1320 » Graph Theory with Applications |
156
click to vote
IPL
2008
15 years 6 months ago
2008
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
186
click to vote
JCC
2002
15 years 6 months ago
2002
: A new method for the characterization of molecules based on the model approach of molecular surfaces is presented. We use the topographical properties of the surface as well as t...
198
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper we examine the general problem of generating preferred explanations for observed behavior with respect to a model of the behavior of a dynamical system. This problem...
165
click to vote
LCTRTS
2007
Springer
16 years 18 days ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
168
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...