10608 search results - page 411 / 2122 » Complexity of O'Hara's Algorithm |
151
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
135
click to vote
CASES
2003
ACM
15 years 9 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
142
click to vote
IFIP
2003
Springer
15 years 9 months ago
2003
Springer
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...
178
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
149
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...