Sciweavers

1660 search results - page 328 / 332
» Forwarding in a content-based network
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
14 years 4 days ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
DCC
2004
IEEE
14 years 4 days ago
Adaptive Rate Control Scheme for Video Streaming Over Wireless Channels
Providing continuous video playback with graceful quality degradation over wireless channels is fraught with challenges. Video applications require stringent delay guarantees and ...
Marwan Krunz, Mohamed Hassan
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 10 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
FAST
2007
13 years 9 months ago
Data ONTAP GX: A Scalable Storage Cluster
Data ONTAP GX is a clustered Network Attached File server composed of a number of cooperating filers. Each filer manages its own local file system, which consists of a number of d...
Michael Eisler, Peter Corbett, Michael Kazar, Dani...
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker