Sciweavers

1332 search results - page 129 / 267
» Combinatorial Algorithms
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 6 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
SAC
2008
ACM
13 years 8 months ago
Computing H/D-exchange speeds of single residues from data of peptic fragments
Determining the hydrogen-deuterium exchange speeds of single residues from data for peptic fragments obtained by FT-ICS MS is currently mainly done by manual interpretation. We pr...
Ernst Althaus, Stefan Canzar, Mark R. Emmett, Andr...
DAM
2011
13 years 4 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
EVOW
2004
Springer
14 years 2 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting