1871 search results - page 59 / 375 » The Ephemeral Pairing Problem |
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
133
click to vote
ICALP
1991
Springer
15 years 2 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
FITRAMEN
2008
15 years 21 days ago
2008
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
ALGORITHMICA
2010
14 years 11 months ago
2010
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
We propose a selection scheme called Fitness-based Neighbor Selection (FNS) for multimodal optimization. The FNS is aimed for ill-scaled and locally multimodal domain, both found ...