1040 search results - page 91 / 208 » Rounding algorithms for covering problems |
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
206
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...