Sciweavers

4066 search results - page 25 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
OPODIS
2001
13 years 9 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
GECCO
2003
Springer
14 years 22 days ago
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
Tadahiko Murata, Shiori Kaige, Hisao Ishibuchi
DAS
2010
Springer
13 years 11 months ago
Improved classification through runoff elections
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
Oleg Golubitsky, Stephen M. Watt
ANCS
2005
ACM
14 years 1 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta