17288 search results - page 44 / 3458 » Hybrid Optimizations: Which Optimization Algorithm to Use |
135
Voted
SETN
2010
Springer
15 years 6 months ago
2010
Springer
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...
150
Voted
SAC
2011
ACM
14 years 5 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
120
Voted
CGF
2005
15 years 2 months ago
2005
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
110
Voted
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
122
Voted
CIBCB
2007
IEEE
15 years 6 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...