736 search results - page 67 / 148 » Approximating the Number of Network Motifs |
WIOPT
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—In this paper, we present our results on the performance of MAC protocols in multi-hop wireless ad hoc networks in terms of the newly proposed metric “aggregate multi-...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
156
click to vote
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
105
click to vote
KAIS
2011
14 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...