453 search results - page 27 / 91 » On Approximation of Bookmark Assignments |
159
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
163
Voted
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
165
Voted
PODC
2009
ACM
16 years 6 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
165
click to vote
ADHOCNOW
2008
Springer
16 years 5 days ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
162
click to vote
GBRPR
2005
Springer
15 years 11 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...