158 search results - page 5 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
IWPEC
2009
Springer
15 years 4 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...
MST
2010
14 years 8 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
TCS
2008
14 years 9 months ago
2008
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
AUTOMATICA
2005
14 years 9 months ago
2005
This paper presents novel analysis results for input-to-state stability (ISS) that utilise dynamic programming techniques to characterise minimal ISS gains and transient bounds. Th...