149 search results - page 20 / 30 » Solving large scale combinatorial optimization using PMA-SLS |
PPL
2010
14 years 6 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
JMLR
2006
14 years 11 months ago
2006
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
109
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
100
click to vote
CONEXT
2010
ACM
14 years 9 months ago
2010
ACM
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...