Sciweavers

2084 search results - page 231 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
TON
2008
76views more  TON 2008»
14 years 10 months ago
Minimizing file download time in stochastic peer-to-peer networks
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show th...
Yuh-Ming Chiu, Do Young Eun
ECCC
2010
92views more  ECCC 2010»
14 years 8 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
ICNP
2005
IEEE
15 years 3 months ago
Stability and Sensitivity for Congestion Control in Wireless Networks with Time Varying Link Capacities
While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both ...
Guohua Zhang, Yiyu Wu, Yonghe Liu
NEUROSCIENCE
2001
Springer
15 years 2 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
100
Voted
ICANN
2005
Springer
15 years 3 months ago
Varying the Population Size of Artificial Foraging Swarms on Time Varying Landscapes
Abstract. Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) entities interacting locally with their environment cause cohere...
Carlos Fernandes, Vitorino Ramos, Agostinho C. Ros...