Sciweavers

4843 search results - page 168 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
110
Voted
JDA
2006
90views more  JDA 2006»
15 years 3 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
91
Voted
AAAI
2008
15 years 5 months ago
A Hybrid Approach to Domino Portrait Generation
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first
Hadrien Cambazard, John Horan, Eoin O'Mahony, Barr...
CPAIOR
2008
Springer
15 years 5 months ago
Fast and Scalable Domino Portrait Generation
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in
Hadrien Cambazard, John Horan, Eoin O'Mahony, Barr...
APPML
2008
99views more  APPML 2008»
15 years 3 months ago
H2-optimal model reduction of MIMO systems
We consider the problem of approximating a p
Paul Van Dooren, Kyle A. Gallivan, Pierre-Antoine ...
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 3 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen