Sciweavers

2924 search results - page 221 / 585
» Lower Bounds in Distributed Computing
Sort
View
SPAA
2003
ACM
15 years 9 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
122
Voted
SPAA
2010
ACM
15 years 8 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...
135
Voted
WCNC
2008
IEEE
15 years 10 months ago
Mitigation of the Propagation of Localization Error Using Multi-Hop Bounding
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
R. Michael Buehrer, Swaroop Venkatesh, Tao Jia
ACSAC
2000
IEEE
15 years 8 months ago
Less Harm, Less Worry or How to Improve Network Security by Bounding System Offensiveness
In this paper we describe a new class of tools for protecting computer systems from security attacks. Their distinguished feature is the principle they are based on. Host or netwo...
Danilo Bruschi, Lorenzo Cavallaro, Emilia Rosti
ATAL
2009
Springer
15 years 10 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski