Sciweavers

2260 search results - page 86 / 452
» A new algorithm for clustering search results
Sort
View
BMCBI
2010
139views more  BMCBI 2010»
15 years 6 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
ICCS
2005
Springer
15 years 11 months ago
A Multi-level Approach for Document Clustering
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
Suely Oliveira, Sang-Cheol Seok
EVOW
2009
Springer
16 years 29 days ago
A Tabu Search Algorithm with Direct Representation for Strip Packing
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
15 years 6 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
AAAI
2000
15 years 7 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...