Sciweavers

889 search results - page 80 / 178
» Observational Learning in Random Networks
Sort
View
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 9 months ago
Average consensus over small world networks: A probabilistic framework
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
Pedram Hovareshti, John S. Baras, Vijay Gupta
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
15 years 3 months ago
On hopeful monsters, neutral networks and junk code in evolving L-systems
This paper investigates L-system evolution through experiments with a simulation platform of virtual plants. The conducted simulations vary the occurrence probability of terminal ...
Stefan Bornhofen, Claude Lattaud
128
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro
ALT
2010
Springer
15 years 4 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
98
Voted
ICAI
2004
15 years 3 months ago
Evaluation of an Agent-Mediated Social Network
The goal of this work is to design and implement an agent-based system that facilitates interaction among a group of individuals who are part of an organization, observe types and...
Taneem Ibrahim, Aaron Arthurs, Henry Hexmoor