10988 search results - page 211 / 2198 » Algorithmic Folding Complexity |
112
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
145
click to vote
ICIA
2007
15 years 6 months ago
2007
We address the problem of users creating visualizations to debug and understand multi-agent systems. The key challenges are that (1) needs arise dynamically, i.e., it is difficult...
133
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
144
click to vote
ALENEX
2010
15 years 5 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...