Results 311 to 320 of about 2,324,507 (326)
Some of the next articles are maybe not open access.
Robust Estimation and Robust Parameter
2020This chapter is addressed to the problem of defining the parameter in a semiparametric situation. Suppose, for example, that the observation X is assumed to be expressed as \(X=\theta +\varepsilon \), where \(\theta \) is the parameter to be estimated and \(\varepsilon \) is the error whose distribution is not specified by a finite number of parameters.
openaire +1 more source
Robustness of optimally robust controllers
[1991 Proceedings] The Twenty-Third Southeastern Symposium on System Theory, 2002The largest robust stability radius gamma (P/sub 0/) of a system P/sub 0/ is defined as the radius of the largest ball B/sub max/ in the gap metric centered at P/sub 0/ which can be stabilized by one single controller. Any controller which stabilizes B/sub max/ is called an optimally robust controller of P/sub 0/.
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2002
Summary: We consider complete graphs with nonnegative edge weights. A \(p\)-matching is a set of \(p\) disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching \(M\) that contains for any \(p\leq|M|\) \(p\) edges whose total weight is at least \({1\over \sqrt 2}\) of the maximum weight of a \(p\)-matching.
Hassin, Refael, Rubinstein, Shlomi
openaire +2 more sources
Summary: We consider complete graphs with nonnegative edge weights. A \(p\)-matching is a set of \(p\) disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching \(M\) that contains for any \(p\leq|M|\) \(p\) edges whose total weight is at least \({1\over \sqrt 2}\) of the maximum weight of a \(p\)-matching.
Hassin, Refael, Rubinstein, Shlomi
openaire +2 more sources
Robust Stability and Robust Stabilizability
2002Most real systems cannot be represented by linear dynamics, but sometimes, under some assumptions, it is possible to model the dynamical behavior of practical systems with a linear model having some uncertainties. The presence of these uncertainties in the dynamics requires the establishment of robust conditions that can guarantee the stability and/or ...
El-Kébir Boukas, Zi-Kuan Liu
openaire +1 more source
Are Robust Circuits Really Robust?
2009 24th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2009Nanoscale systems are characterized by increasing parameter variations as well as an increasing susceptibility to soft errors. Transient errors during system operation are no longer restricted to memories but also affect random logic, and robust circuit design has thus become a major concern for system developers.
Sybille Hellebrand, Marc Hunger
openaire +1 more source
Annals of the New York Academy of Sciences, 2002
Abstract: Developmental robustness, the capacity to stay “on track” despite the myriad vicissitudes that inevitably plague a developing organism, is, I argue, a prerequisite for natural selection and key to our understanding of the evolution of developmental processes. But how is such robustness achieved?
openaire +2 more sources
Abstract: Developmental robustness, the capacity to stay “on track” despite the myriad vicissitudes that inevitably plague a developing organism, is, I argue, a prerequisite for natural selection and key to our understanding of the evolution of developmental processes. But how is such robustness achieved?
openaire +2 more sources
Journal of Economic Theory, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A note on criterion robustness and inference robustness
Biometrika, 1964Box, G. E. P., Tiao, G. C.
openaire +2 more sources
Abstract: We review the LiNGAM structural causal model, its identifiability properties and the three most popular algorithms for fitting the model on real data. We illustrate the sensitivity of these algorithms to a single outlier in the data. A robust counterpart for each of the three algorithms is presented, and it is shown that one of them, TSLiNGAM,
openaire +2 more sources
openaire +2 more sources

