Results 1  10
of
486,007
Systematic design of program analysis frameworks
 In 6th POPL
, 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract

Cited by 765 (50 self)
 Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant
Approximately invariant manifolds and global dynamics of spike states
 INVENT. MATH.
, 2008
"... We investigate the existence of a true invariant manifold given an approximately invariant manifold for an infinitedimensional dynamical system. We prove that if the given manifold is approximately invariant and approximately normally hyperbolic, then the dynamical system has a true invariant mani ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We investigate the existence of a true invariant manifold given an approximately invariant manifold for an infinitedimensional dynamical system. We prove that if the given manifold is approximately invariant and approximately normally hyperbolic, then the dynamical system has a true invariant
Approximating invariant densities of metastable systems
, 905
"... We consider a piecewise smooth expanding map of the interval possessing two invariant subsets of positive Lebesgue measure and exactly two ergodic absolutely continuous invariant probability measures (ACIMs). When this system is perturbed slightly to make the invariant sets merge, we describe how th ..."
Abstract
 Add to MetaCart
We consider a piecewise smooth expanding map of the interval possessing two invariant subsets of positive Lebesgue measure and exactly two ergodic absolutely continuous invariant probability measures (ACIMs). When this system is perturbed slightly to make the invariant sets merge, we describe how
Approximate invariance and differential inclusions in Hilbert spaces
, 1995
"... Consider a mapping F from a Hilbert space H to the subsets of H which is upper semicontinuous/Lipschitz, has nonconvex, noncompact values and satisfies to a linear growth condition. We give necessary and sufficient conditions for a subset S of H to be approximately weak/strong invariant with respect ..."
Abstract
 Add to MetaCart
Consider a mapping F from a Hilbert space H to the subsets of H which is upper semicontinuous/Lipschitz, has nonconvex, noncompact values and satisfies to a linear growth condition. We give necessary and sufficient conditions for a subset S of H to be approximately weak/strong invariant
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
in a more gen eral setting? We compare the marginals com puted using loopy propagation to the exact ones in four Bayesian network architectures, including two realworld networks: ALARM and QMR. We find that the loopy beliefs of ten converge and when they do, they give a good approximation
On the Threshold for Observing Approximate Invariance of Effective Bandwidth
"... Abstract—Effective bandwidth is a descriptor in the context of stochastic models for statistical sharing of resources. One of the most interesting properties of effective bandwidth is that it does not change when passing a network node under many sources limiting regime (infinitely many sources). Th ..."
Abstract
 Add to MetaCart
number of independent multiplexing flows at each network node to observe approximate invariance of effective bandwidth is that the task of network resources dimensioning can be greatly simplified. I.
A fast method for approximating invariant manifolds
 SIAM Journal of Applied Dynamical Systems
, 2004
"... The task of constructing higherdimensional invariant manifolds for dynamical systems can be computationally expensive. We demonstrate that this problem can be locally reduced to solving a system of quasilinear PDEs, which can be efficiently solved in an Eulerian framework. We construct a fast nume ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
The task of constructing higherdimensional invariant manifolds for dynamical systems can be computationally expensive. We demonstrate that this problem can be locally reduced to solving a system of quasilinear PDEs, which can be efficiently solved in an Eulerian framework. We construct a fast
Approximate invariant manifolds up to exponentially small terms
 Journal of Differential Equations
, 2010
"... This paper is devoted to analytic vector fields near an equilibrium for which the linearized system is split in two invariant subspaces E0 (dim m0), E1 (dim m1). Under light diophantine conditions on the linear part, we prove that there is a polynomial change of coordinate in E1 allowing to eliminat ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper is devoted to analytic vector fields near an equilibrium for which the linearized system is split in two invariant subspaces E0 (dim m0), E1 (dim m1). Under light diophantine conditions on the linear part, we prove that there is a polynomial change of coordinate in E1 allowing
Approximate Invariant Subspaces and QuasiNewton Optimization Methods
, 2009
"... New approximate secant equations are shown to result from the knowledge of (problem dependent) invariant subspace information, which in turn suggests improvements in quasiNewton methods for unconstrained minimization. A new limitedmemory BFGS using approximate secant equations is then derived and i ..."
Abstract
 Add to MetaCart
New approximate secant equations are shown to result from the knowledge of (problem dependent) invariant subspace information, which in turn suggests improvements in quasiNewton methods for unconstrained minimization. A new limitedmemory BFGS using approximate secant equations is then derived
Numerical Methods for Approximating Invariant Manifolds of Delayed Systems
, 2008
"... In this paper we develop methods for computing k−dimensional invariant manifolds of delayed systems for k ≥ 2. For small delays, we consider methods for approximating delay differential equations (DDEs) with ordinary differential equations (ODEs). Once these approximations are made, any existing met ..."
Abstract
 Add to MetaCart
In this paper we develop methods for computing k−dimensional invariant manifolds of delayed systems for k ≥ 2. For small delays, we consider methods for approximating delay differential equations (DDEs) with ordinary differential equations (ODEs). Once these approximations are made, any existing
Results 1  10
of
486,007