170 search results - page 15 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
PPSN
2004
Springer
14 years 27 days ago
2004
Springer
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
SIROCCO
2008
13 years 9 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
TKDE
2008
13 years 7 months ago
2008
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
DAGM
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. High-speed image measurements of fluid flows define an important field of research in experimental fluid mechanics and the related industry. Numerous competing methods ha...