Sciweavers

33 search results - page 4 / 7
» Decentralized Network Connection Preemption Algorithms
Sort
View
CDC
2008
IEEE
14 years 1 months ago
On stability in the presence of analog erasure channels
— Consider a discrete-time networked control scheme, in which the controller has direct access to noisy measurements of the plant’s output, but the controller and the actuator ...
Vijay Gupta, Nuno C. Martins
SECON
2010
IEEE
13 years 5 months ago
Multiple Access Mechanisms with Performance Guarantees for Ad-Hoc Networks
This paper bears on the design and the quantitative evaluation of MAC mechanisms for wireless ad-hoc networks with performance guarantees. By this, we mean mechanisms where each ac...
Paola Bermolen, François Baccelli
MOBIHOC
2012
ACM
11 years 9 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
FGCS
2008
95views more  FGCS 2008»
13 years 5 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
Hai Jin, Hanhua Chen
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins