101 search results - page 7 / 21 » To Be and Not To Be: 3-Valued Relations on Graphs |
NETWORKS
2002
13 years 7 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
GECCO
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
DAM
2007
13 years 7 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
KR
2004
Springer
14 years 1 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
BMCBI
2006
13 years 7 months ago
2006
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...