Sciweavers

483 search results - page 4 / 97
» Linear Ranking with Reachability
Sort
View
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 6 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
13 years 5 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
GLOBECOM
2006
IEEE
13 years 12 months ago
Properties of Codes with the Rank Metric
In this paper, we study the rank distributions of linear codes. We give the analogous to the MacWilliams identity for the rank distributions of codes. The considerations of our pr...
Maximilien Gadouleau, Zhiyuan Yan
IPMU
2010
Springer
13 years 3 months ago
Rank Correlation Coefficient Correction by Removing Worst Cases
Abstract. Rank correlation can be used to compare two linearly ordered rankings. If the rankings include noise values, the rank correlation coefficient will yield lower values than...
Martin Krone, Frank Klawonn
ESA
2007
Springer
99views Algorithms» more  ESA 2007»
13 years 12 months ago
Linear-Time Ranking of Permutations
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
Martin Mares, Milan Straka