9842 search results - page 1357 / 1969 » Problem complexity |
172
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
203
Voted
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
183
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
235
Voted
IPSN
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
198
Voted
PODC
2006
ACM
16 years 1 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...