Sciweavers

806 search results - page 134 / 162
» Lower Bounds on Correction Networks
Sort
View
SPAA
2003
ACM
14 years 3 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
SPAA
2010
ACM
14 years 3 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
MOBIHOC
2002
ACM
14 years 10 months ago
Weak duplicate address detection in mobile ad hoc networks
Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirabl...
Nitin H. Vaidya
NCA
2009
IEEE
14 years 5 months ago
Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...
Steve Thompson, Lester Lipsky, Sarah Tasneem, Feng...
ICDCSW
2008
IEEE
14 years 4 months ago
Towards Cyber-Physical Holodeck Systems Via Physically Rendered Environments (PRE's)
We present an early vision of a cyber-physical environment in which computer controlled rendering of physical surfaces, terrains, and environments is achieved by manipulating grid...
Veljko Krunic, Richard Han