2027 search results - page 11 / 406 » When is it best to best-respond |
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
P2P
2005
IEEE
14 years 3 months ago
2005
IEEE
We address the problem of highly transient populations in unstructured and loosely-structured peerto-peer systems. We propose a number of illustrative query-related strategies and...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
ICNC
2005
Springer
14 years 3 months ago
2005
Springer
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
WSOM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The distribution of a class of objects, such as images depicting a specific topic, can be studied by observing the best-matching units (BMUs) of the objects’ feature v...