Sciweavers

4072 search results - page 481 / 815
» Designing an Optimal Network Using the Cross-Entropy Method
Sort
View
132
Voted
GECCO
2004
Springer
15 years 9 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
WEA
2009
Springer
111views Algorithms» more  WEA 2009»
15 years 11 months ago
A Heuristic for Fair Correlation-Aware Resource Placement
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
Raouf Boutaba, Martin Karsten, Maxwell Young
EVOW
2001
Springer
15 years 8 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
DASFAA
2005
IEEE
209views Database» more  DASFAA 2005»
15 years 9 months ago
PADS: Protein Structure Alignment Using Directional Shape Signatures
A novel approach for similarity search on the protein structure databases is proposed. PADS (Protein Alignment by Directional shape Signatures) incorporates the three dimensional ...
S. Alireza Aghili, Divyakant Agrawal, Amr El Abbad...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
15 years 7 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...