2356 search results - page 153 / 472 » Characterizations of postman sets |
150
click to vote
AUTOMATICA
2002
15 years 4 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
115
click to vote
AUTOMATICA
2002
15 years 4 months ago
2002
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
116
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
118
click to vote
IGPL
1998
15 years 4 months ago
1998
One of the ways to model contraction functions for belief sets is epistemic entrenchment. The first step was provided by G¨ardenfors in [5], who defined epistemic entrenchment ...
153
Voted
CORR
2010
Springer
15 years 4 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...