1414 search results - page 30 / 283 » Cover Time and Broadcast Time |
113
Voted
DSN
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper presents a novel adaptation mechanism that allows every node of a gossip-based broadcast algorithm to adjust the rate of message emission 1) to the amount of resources ...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
ESA
2005
Springer
15 years 6 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
140
click to vote
OR
2007
Springer
15 years 7 days ago
2007
Springer
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
106
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...