Sciweavers

9849 search results - page 204 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 11 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 11 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 11 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 10 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
GECCO
2004
Springer
15 years 10 months ago
Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
Wilfried Jakob, Christian Blume, Georg Bretthauer