5595 search results - page 126 / 1119 » Approximation Algorithms for Clustering Problems |
156
Voted
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
150
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
148
click to vote
CCCG
2010
15 years 6 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
137
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
140
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...