Sciweavers

3247 search results - page 288 / 650
» Randomized smoothing networks
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
Interaction of TCP Flows as Billiards
Abstract— The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the net...
François Baccelli, Dohy Hong
MABS
2000
Springer
15 years 9 months ago
Effects of Interaction Topology and Activation Regime in Several Multi-Agent Systems
The effects of distinct agent interaction and activation structures are compared and contrasted in several multi-agent models of social phenomena. Random graphs and lattices repre...
Robert L. Axtell
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 4 months ago
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
Yuxin Chen, Jeffrey Andrews
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
16 years 19 days ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
IJCNN
2006
IEEE
16 years 5 days ago
Preparing More Effective Liquid State Machines Using Hebbian Learning
—In Liquid State Machines, separation is a critical attribute of the liquid—which is traditionally not trained. The effects of using Hebbian learning in the liquid to improve s...
David Norton, Dan Ventura