2796 search results - page 203 / 560 » The coolest path problem |
177
click to vote
WSC
2007
15 years 9 months ago
2007
We consider the problem of estimating the time-average variance constant for a stationary process. A previous paper described an approach based on multiple integrations of the sim...
161
click to vote
DM
2006
15 years 6 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
155
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
152
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
177
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper presents a novel market model for balancing communication bandwidth trade. The distinguishing characteristic of the model is that it assumes that market players can pl...