1013 search results - page 53 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
107
Voted
EVOW
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
120
Voted
DGCI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Discrete tomography concerns the reconstruction of functions with a finite number of values from few projections. For a number of important real-world problems, this tomo...
147
click to vote
CPAIOR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
103
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract-- Due to the development of Next Generation Networks, leading to a multiservice transport layer with a multidomain environment, the importance of interconnection issues ke...
142
Voted
JCP
2007
15 years 2 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...