616 search results - page 7 / 124 » Hybrid Numerical Optimization for Combinatorial Network Prob... |
SAC
2011
ACM
12 years 10 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 ...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...