Sciweavers

3136 search results - page 139 / 628
» Complex networks and evolutionary computation
Sort
View
PPSN
2004
Springer
15 years 9 months ago
A Neuroevolutionary Approach to Emergent Task Decomposition
A scalable architecture to facilitate emergent (self-organized) task decomposition using neural networks and evolutionary algorithms is presented. Various control system architectu...
Jekanthan Thangavelautham, Gabriele M. T. D'Eleute...
PODC
2006
ACM
15 years 10 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
IPPS
1999
IEEE
15 years 8 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
GECCO
2009
Springer
157views Optimization» more  GECCO 2009»
15 years 11 months ago
Multi material topological optimization of structures and mechanisms
Multi-material 3D-printing technologies permit the freeform fabrication of complex spatial arrangements of materials in arbitrary geometries. This technology has opened the door t...
Jonathan D. Hiller, Hod Lipson
CEC
2011
IEEE
14 years 4 months ago
Trainer selection strategies for coevolving rank predictors
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Daniel L. Ly, Hod Lipson