Sciweavers

362 search results - page 53 / 73
» Optimal network topologies for local search with congestion
Sort
View
BMCBI
2006
113views more  BMCBI 2006»
14 years 9 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
COMSUR
2011
221views Hardware» more  COMSUR 2011»
13 years 9 months ago
Computational Intelligence in Wireless Sensor Networks: A Survey
—Wireless sensor networks (WSNs) are networks of distributed autonomous devices that can sense or monitor physical or environmental conditions cooperatively. WSNs face many chall...
Raghavendra V. Kulkarni, A. Forster, Ganesh K. Ven...
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 2 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
MSWIM
2006
ACM
15 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari