Sciweavers

Share
7 search results - page 1 / 2
» alenex 2009
Sort
View
ALENEX
2009
107views Algorithms» more  ALENEX 2009»
11 years 7 months ago
Tuning BNDM with q-Grams
Branislav Durian, Jan Holub, Hannu Peltola, Jorma ...
ALENEX
2009
97views Algorithms» more  ALENEX 2009»
11 years 4 months ago
Quasirandom Rumor Spreading: An Experimental Analysis
Benjamin Doerr, Tobias Friedrich, Marvin Künn...
ALENEX
2009
115views Algorithms» more  ALENEX 2009»
11 years 7 months ago
Experimental comparison of the two Fredman-Khachiyan-algorithms
We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...
Matthias Hagen, Peter Horatschek, Martin Mundhenk
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
11 years 7 months ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
11 years 7 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
books