Sciweavers

518 search results - page 93 / 104
» Beating a Random Assignment
Sort
View
CONCUR
2009
Springer
15 years 6 months ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
WCNC
2008
IEEE
15 years 6 months ago
Optimal Strategies for Cooperative MAC-Layer Retransmission in Wireless Networks
—The concept of cooperative retransmission in wireless networks has attracted considerable research attention. The basic idea is that when a receiver cannot decode a frame, the r...
Lixiang Xiong, Lavy Libman, Guoqiang Mao
89
Voted
IPSN
2007
Springer
15 years 5 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
P2P
2005
IEEE
106views Communications» more  P2P 2005»
15 years 5 months ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
IWQOS
2005
Springer
15 years 5 months ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...