18306 search results - page 497 / 3662 » Algorithmics in Exponential Time |
260
click to vote
OL
2011
15 years 2 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
229
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
172
click to vote
STOC
2003
ACM
16 years 8 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
197
click to vote
ISSAC
2009
Springer
16 years 2 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
174
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper mathematically frames the relation between window-based and rate-based congestion control algorithms, when the assumption of variable round-trip time conditions is i...