Sciweavers

14165 search results - page 182 / 2833
» The generalized two-server problem
Sort
View
HYBRID
2009
Springer
15 years 11 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
SOFSEM
2007
Springer
15 years 10 months ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon
FSTTCS
2004
Springer
15 years 9 months ago
Genome Halving Problem Revisited
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Max A. Alekseyev, Pavel A. Pevzner
FSTTCS
2000
Springer
15 years 7 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
AAAI
2007
15 years 6 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...