Sciweavers

108 search results - page 16 / 22
» Valuing search and communication in partially-observable coo...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
A few good agents: multi-agent social learning
In this paper, we investigate multi-agent learning (MAL) in a multi-agent resource selection problem (MARS) in which a large group of agents are competing for common resources. Si...
Jean Oh, Stephen F. Smith
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
13 years 11 months ago
Exploring network topology evolution through evolutionary computations
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
Sami J. Habib, Alice C. Parker
ICALP
2005
Springer
14 years 27 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 5 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis