Sciweavers

583 search results - page 38 / 117
» Computing Linking Numbers of a Filtration
Sort
View
MOBIHOC
2005
ACM
14 years 9 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas
TCSV
2010
13 years 4 months ago
Cooperative Peer-to-Peer Streaming: An Evolutionary Game-Theoretic Approach
While peer-to-peer (P2P) video streaming systems have achieved promising results, they introduce a large number of unnecessary traverse links, which consequently leads to substanti...
Yan Chen, Beibei Wang, W. Sabrina Lin, Yongle Wu, ...
CONEXT
2005
ACM
13 years 12 months ago
The stability of paths in a dynamic network
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghe...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 3 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
DISOPT
2008
81views more  DISOPT 2008»
13 years 10 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...