Sciweavers

349 search results - page 32 / 70
» Optimal Strategies for Reviewing Search Results
Sort
View
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
15 years 4 months ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 3 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong
PROMISE
2010
14 years 6 months ago
How effective is Tabu search to configure support vector regression for effort estimation?
Background. Recent studies have shown that Support Vector Regression (SVR) has an interesting potential in the field of effort estimation. However applying SVR requires to careful...
Anna Corazza, Sergio Di Martino, Filomena Ferrucci...
CP
2003
Springer
15 years 5 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
IPPS
2000
IEEE
15 years 4 months ago
Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
Suchendra M. Bhandarkar, Salem Machaka, Sanjay She...