3475 search results - page 341 / 695 » Backbones in Optimization and Approximation |
223
click to vote
ANTSW
2010
Springer
15 years 4 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
192
click to vote
FLAIRS
2010
15 years 4 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
141
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We study a deployment strategy for a group of vehicles that drift in an ambient flow field. Specifically, we address the case where the flow is always greater in magnitude than an ...
178
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
164
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...