5624 search results - page 711 / 1125 » On Conditional Covering Problem |
137
Voted
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper addresses the exact transformation of nonlinear systems into a multiple model form with unmeasurable premise variables. The multiple model structure serves to treat ...
146
Voted
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
140
click to vote
EMSOFT
2001
Springer
15 years 9 months ago
2001
Springer
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...
157
Voted
ICANN
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. In this paper, we propose and study a new on-line algorithm for learning a SVM based on Radial Basis Function Kernel: Local Incremental Learning of SVM or LISVM. Our meth...
134
Voted
IWANN
2001
Springer
15 years 9 months ago
2001
Springer
Complexity-penalization strategies are one way to decide on the most appropriate network size in order to address the trade-off between overfitted and underfitted models. In this p...