2168 search results - page 176 / 434 » Randomized Algorithms and Complexity Theory |
148
Voted
AGI
2011
14 years 7 months ago
2011
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
143
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
134
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
170
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
123
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...