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
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Defect detection in images is a current task in quality control and is often integrated in partially or fully automated systems. Assessing the performances of defect detection algo...
Yann Le Meur, Jean-Michel Vignolle, Jocelyn Chanus...
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Background: Affymetrix GeneChip microarrays are popular platforms for expression profiling in two types of studies: detection of differential expression computed by p-values of t-...
Jakub Mieczkowski, Magdalena E. Tyburczy, Michal D...