1351 search results - page 56 / 271 » New Research Directions in Search Results Clustering |
202
click to vote
GECCO
2009
Springer
16 years 22 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
139
click to vote
LCN
2007
IEEE
16 years 13 days ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
158
click to vote
SIGIR
2004
ACM
15 years 11 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
168
click to vote
CLUSTER
2003
IEEE
15 years 11 months ago
2003
IEEE
Memory may be the only system component that is more commoditized than a microprocessor. To simultaneously exploit this and address the impending memory wall, processing in memory...
120
click to vote
CEC
2007
IEEE
16 years 15 days ago
2007
IEEE
— This paper presents a simple and generic indicator-based multi-objective local search. This algorithm is a direct extension of the IBEA algorithm, an indicatorbased evolutionar...