Sciweavers

12265 search results - page 249 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
JSSPP
2004
Springer
15 years 12 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 6 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 3 days 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
IJCNN
2000
IEEE
15 years 11 months ago
Fuzzy Clustering Algorithm Extracting Principal Components Independent of Subsidiary Variables
Fuzzy c-varieties (FCV) is one of the clustering algorithms in which the prototypes are multi-dimensional linear varieties. The linear varieties are represented by some local prin...
Chi-Hyon Oh, Hirokazu Komatsu, Katsuhiro Honda, Hi...
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
15 years 11 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer