Sciweavers

2899 search results - page 103 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
PODC
2012
ACM
13 years 4 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 7 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
BMCBI
2010
156views more  BMCBI 2010»
15 years 1 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...
CEC
2008
IEEE
15 years 8 months ago
Auto-tuning fuzzy granulation for evolutionary optimization
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
ICC
2007
IEEE
15 years 7 months ago
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
Edwin Soedarmadji, Robert J. McEliece