نتایج جستجو برای: maximum admissible upper bound

تعداد نتایج: 643747  

Journal: :CoRR 2016
David Cox

In this paper, we introduce δǫα∗ – a minimal coverage, real-time robotic search algorithm that yields a moderately aggressive search path with minimal backtracking. Search performance is bounded by a placing a combinatorial bound, ǫ and δ, on the maximum deviation from the theoretical shortest path and the probability at which further deviations can occur. Additionally, we formally define the n...

2014
R. Chandran

In this paper, we investigate the delay-dependent robust stability of fuzzy Cohen-Grossberg neural networks with Markovian jumping parameter and mixed time varying delays by delay decomposition method. A new Lyapunov-Krasovskii functional (LKF) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...

2007
Jin Zhu Junhong Park Kwan-Soo Lee

Robust Kalman filtering problems for discrete-time Markovian jump systems with parameter and noise uncertainty were investigated. Because of the existence of stochastic Markovian switching, the covariance matrices of system state noise and observation noise are time-varying or unmeasurable instead of stationary, meanwhile the system suffers from structure parameter uncertainty as well. By view ...

‎In this paper we give an upper bound for Noetherian dimension of all injective modules with Krull dimension on arbitrary rings‎. ‎In particular‎, ‎we also give an upper bound for Noetherian dimension of all Artinian modules on Noetherian duo rings.

Journal: :Adv. Data Analysis and Classification 2018
Gunnar E. Carlsson Facundo Mémoli Alejandro Ribeiro Santiago Segarra

This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods that, based on the dissimilarity structure, output hierarchical clusters, i.e., a family of nested partitions indexed by a connectivity parameter. Our construction of hierarchical clustering methods is built around the concept of admissible methods, which are...

1998
Karl Crary

Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned types using xpoint induction. However, xpoint induction is valid only on admissible types. Previous work has shown many types to be admissible, but has not shown any dependent products to be admissible. Disallowing recur...

2001
Author Yang Fuwen Yang Zidong Wang Y. S. Hung

In this note, a robust finite-horizon Kalman filter is designed for discrete time-varying uncertain systems with both additive and multiplicative noises. The system under consideration is subject to both deterministic and stochastic uncertainties. Sufficient conditions for the filter to guarantee an optimized upper bound on the state estimation error variance for admissible uncertainties are es...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید