2899 search results - page 418 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
130
click to vote
RTSS
2002
IEEE
15 years 10 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
140
Voted
IPPS
1994
IEEE
15 years 9 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
134
click to vote
CIDM
2007
IEEE
15 years 9 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
155
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
177
click to vote
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
An easily implementable mixed-integer algorithm is proposed that generates a nonlinear kernel support vector machine (SVM) classifier with reduced input space features. A single ...