2694 search results - page 314 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
161
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
139
click to vote
ICCV
1998
IEEE
16 years 8 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
160
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
182
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
177
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we develop a beamforming algorithm for multiuser MIMO-relaying wireless systems. We consider a relaying scenario with multiple sources transmitting to one or more d...