1086 search results - page 107 / 218 » Jug measuring: Algorithms and complexity |
WAW
2007
Springer
15 years 3 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
119
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
71
Voted
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
IJRR
2007
14 years 9 months ago
2007
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...