Sciweavers

438 search results - page 1 / 88
» On Perfect Switching Classes
Sort
View
DAM
1998
78views more  DAM 1998»
13 years 4 months ago
On Perfect Switching Classes
Alain Hertz
CDC
2008
IEEE
200views Control Systems» more  CDC 2008»
13 years 11 months ago
Maximum-likelihood Kalman filtering for switching discrete-time linear systems
— State estimation is addressed for a class of discrete-time systems that may switch among different modes taken from a finite set. The system and measurement equations of each ...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...
APAL
2008
62views more  APAL 2008»
13 years 4 months ago
The upward closure of a perfect thin class
There is a perfect thin 0 1 class whose upward closure in the Turing degrees has full measure (and indeed contains every 2-random degree.) Thus, in the Muchnik lattice of 0 1 class...
Rod Downey, Noam Greenberg, Joseph S. Miller
JCT
2006
79views more  JCT 2006»
13 years 4 months ago
A class of perfectly contractile graphs
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
Frédéric Maffray, Nicolas Trotignon
INFOCOM
2005
IEEE
13 years 10 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic