3136 search results - page 17 / 628 » Complex networks and evolutionary computation |
AAAI
2006
15 years 1 months ago
2006
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
125
click to vote
EUROGP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
A need for solving more and more complex problems drives the Evolutionary Computation community towards advanced models of Evolutionary Algorithms. One such model is the island mo...
WABI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Computational inference of transcriptional regulatory networks remains a challenging problem, in part due to the lack of strong network models. In this paper we present e...
107
click to vote
COMPLEX
2009
Springer
15 years 6 months ago
2009
Springer
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...