Sciweavers

91 search results - page 16 / 19
» Symmetries, local names and dynamic (de)-allocation of names
Sort
View
IJCAI
2007
13 years 9 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb
CCR
2005
96views more  CCR 2005»
13 years 7 months ago
Stability of end-to-end algorithms for joint routing and rate control
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...
Frank P. Kelly, Thomas Voice
ISPDC
2010
IEEE
13 years 6 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
ISSTA
2010
ACM
13 years 11 months ago
Automatic detection of unsafe component loadings
Dynamic loading of software components (e.g., libraries or modules) is a widely used mechanism for improved system modularity and flexibility. Correct component resolution is cri...
Taeho Kwon, Zhendong Su
ECCV
2008
Springer
14 years 9 months ago
Floor Fields for Tracking in High Density Crowd Scenes
Abstract. This paper presents an algorithm for tracking individual targets in high density crowd scenes containing hundreds of people. Tracking in such a scene is extremely challen...
Saad Ali, Mubarak Shah