518 search results - page 14 / 104 » Beating a Random Assignment |
IVC
2007
14 years 11 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
ICPR
2004
IEEE
16 years 25 days ago
2004
IEEE
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Due to increasing complexity of design interactions between the chip, package and PCB, it is essential to consider them at the same time. Specifically the finger/pad locations...
COR
2006
14 years 11 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
120
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...