Sciweavers

222 search results - page 8 / 45
» Symmetry and Search in a Network Design Problem
Sort
View
NICSO
2010
Springer
15 years 6 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 6 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
15 years 5 months ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee
ICPADS
2006
IEEE
15 years 5 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
ISPA
2004
Springer
15 years 5 months ago
A Congestion-Aware Search Protocol for Unstructured Peer-to-Peer Networks
Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the sca...
Kin Wah Kwong, Danny H. K. Tsang