Sciweavers

3247 search results - page 273 / 650
» Randomized smoothing networks
Sort
View
MOBICOM
2000
ACM
15 years 10 months ago
Pushing dependent data in clients-providers-servers systems
In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin man...
Amotz Bar-Noy, Joseph Naor, Baruch Schieber
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 6 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
ICWMC
2006
IEEE
16 years 4 hour ago
Mobility Models for UAV Group Reconnaissance Applications
In MANET research the mobility of the nodes is often described using standard synthetic models. Given a particular application, e.g. networks of unmanned aerial vehicles (UAVs) pe...
Erik Kuiper, Simin Nadjm-Tehrani
AUTOMATICA
2008
104views more  AUTOMATICA 2008»
15 years 6 months ago
Communication constraints in the average consensus problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of aut...
Ruggero Carli, Fabio Fagnani, Alberto Speranzon, S...
IMC
2010
ACM
15 years 3 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim