Sciweavers

3136 search results - page 124 / 628
» Complex networks and evolutionary computation
Sort
View
SIROCCO
2003
15 years 5 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 9 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
CORR
2008
Springer
208views Education» more  CORR 2008»
15 years 4 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
GRID
2000
Springer
15 years 8 months ago
An Advanced User Interface Approach for Complex Parameter Study Process Specification on the Information Power Grid
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
Maurice Yarrow, Karen M. McCann, Rupak Biswas, Rob...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 8 months ago
A Note on Learning and Evolution in Neural Networks
Interactions between evolution and lifetime learning are of great interest to studies of adaptive behaviour both in the natural world and the field of evolutionary computation. Th...
Brian Carse, Johan Oreland