5624 search results - page 265 / 1125 » On Conditional Covering Problem |
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
192
click to vote
EOR
2011
14 years 10 months ago
2011
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relati...
188
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
153
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper deals with the magnetization switching in small ferromagnetic particles. Particularly important for applications, this problem is tackled with two different controls...
149
click to vote
ICRA
1995
IEEE
15 years 10 months ago
1995
IEEE
Using redundant sensors, the direct kinematics of general parallel manipulators is here decoupled and reduced to an orientation problem only. The accuracy of the decoupling depend...