3875 search results - page 707 / 775 » Approximation algorithms for the 0-extension problem |
136
click to vote
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
CIKM
2003
Springer
15 years 3 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...