14548 search results - page 232 / 2910 » The Optimal Path-Matching Problem |
101
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
116
click to vote
MOR
2007
15 years 2 months ago
2007
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
154
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
110
click to vote
ATMOS
2010
15 years 1 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
89
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...