Topic
Bounding overwatch
About: Bounding overwatch is a research topic. Over the lifetime, 966 publications have been published within this topic receiving 15156 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, it was shown that variance bounding is equivalent to the existence of usual central limit theorems for all $L 2$ functionals for all reversible Markov chains.
Abstract: We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all $L^2$ functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Peskun order. We close with some applications to Metropolis--Hastings algorithms.
44 citations
TL;DR: In this article, the problem of finding a hyper-pyramid to bound the set of states that are reachable from the origin in the Euclidean space is addressed, subject to inputs whose ( 1, 1 ) -norm or ( ∞, 1 ) −norm is bounded by a prescribed constant.
44 citations
TL;DR: A new approach is proposed to obtain the smallest box which bounds all reachable sets of a class of nonlinear time-delay systems with bounded disturbances.
44 citations
01 Jan 1984
TL;DR: In this paper, game-theoretic concepts are used to bound the solution of the continuous version of the optimal equilibrium network design problem by using two computationally efficient heuristics, which can then be used to assess whether or not it is necessary to solve for the exact solution.
Abstract: The solution of the optimal equilibrium network design problem is perhaps the most computationally intensive problem encountered in transportation network analysis. This paper illustrates through the use of game-theoretic concepts how one can bound the solution of the continuous version of this problem by using two computationally efficient heuristics. This bounding procedure can then be used to assess whether or not it is necessary to solve for the exact solution to this problem. A numerical example is presented which illustrates this procedure. (Author/TRRL)
44 citations
12 Dec 2007
TL;DR: This paper shows how to get message boundedness "for free" under a reasonable (syntactic) assumption on protocols, which is called well-formedness, which enables us to improve existing decidability results.
Abstract: The verification of security protocols has been proven to be undecidable in general. Different approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs, therefore bounding message length. In this paper, we show how to get message boundedness "for free" under a reasonable (syntactic) assumption on protocols, which we call well-formedness. This enables us to improve existing decidability results.
44 citations