4843 search results - page 346 / 969 » The Shortcut Problem - Complexity and Approximation |
160
click to vote
CVPR
2010
IEEE
16 years 20 days ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
126
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
134
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
154
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
151
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov