2463 search results - page 242 / 493 » Rankings of Directed Graphs |
131
click to vote
GECCO
2003
Springer
15 years 9 months 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 ...
128
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
123
click to vote
IC
2003
15 years 5 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
127
click to vote
DAM
2007
15 years 3 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 ...
127
click to vote
JETAI
1998
15 years 3 months 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...