1064 search results - page 161 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
112
click to vote
SIAMMAX
2010
14 years 10 months ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
139
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
147
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
133
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
147
click to vote
QEST
2007
IEEE
15 years 10 months ago
2007
IEEE
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...