644 search results - page 18 / 129 » Decomposition Complexity |
77
Voted
EOR
2006
15 years 14 days ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
212
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
104
click to vote
IJRR
2008
15 years 14 days ago
2008
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
92
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
101
Voted
ISSAC
2005
Springer
15 years 6 months ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...