Sciweavers

17760 search results - page 71 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
SOFSEM
2010
Springer
15 years 10 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
CEC
2007
IEEE
15 years 3 months ago
A novel general framework for evolutionary optimization: Adaptive fuzzy fitness granulation
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 2 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 1 months ago
On generalized Frame-Stewart numbers
For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: ...
Jonathan Chappelon, Akihiro Matsuura
DM
2008
123views more  DM 2008»
15 years 1 months ago
Graphic sequences with a realization containing a generalized friendship graph
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
Jian-Hua Yin, Gang Chen, John R. Schmitt