451 search results - page 47 / 91 » Simulated Annealing for Convex Optimization |
149
Voted
SECON
2008
IEEE
15 years 10 months ago
2008
IEEE
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
164
Voted
UAI
2003
15 years 5 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
124
Voted
PE
2007
Springer
15 years 3 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
139
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
129
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...