5595 search results - page 259 / 1119 » Approximation Algorithms for Clustering Problems |
164
click to vote
INFOCOM
2005
IEEE
16 years 1 days ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
203
click to vote
AAAI
2000
15 years 7 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
192
click to vote
DCOSS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
181
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
165
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...