963 search results - page 118 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
COR
2010
14 years 10 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
100
click to vote
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
TSP
2010
14 years 4 months ago
2010
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The practical implementation of Min-Max MPC (MMMPC) controllers is limited by the computational burden required to compute the control law. This problem can be circumvented by ...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...