2926 search results - page 344 / 586 » Partially Optimal Routing |
105
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
We describe and evaluate a multi-objective optimisation (MOO) algorithm that works within the Probability Collectives (PC) optimisation framework. PC is an alternative approach to ...
142
Voted
LION
2009
Springer
15 years 10 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
96
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
155
Voted
HUMO
2007
Springer
15 years 7 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
160
click to vote
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...