Results 1  10
of
765
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 676 (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
Exponential tracking and approximation of inertial manifolds for dissipative nonlinear equations
 J. Dynam. Differential Equations
, 1989
"... In this paper, we study the longtime behavior of a class of nonlinear dissipative partial differential equations. By means of the LyapunovPerron method, we show that the equation has an inertial manifold, provided that certain gap condition in the spectrum of the linear part of the equation is sat ..."
Abstract

Cited by 61 (11 self)
 Add to MetaCart
is the introduction of a modified Galerkin approximation for analyzing the original PDE. In an illustrative example (which we believe to be typical), we show that this modified Galerkin approximation yields a smaller error than the standard Galerkin approximation. KEY WORDS: equations. Dissipation; exponential
GALERKIN FINITE ELEMENT APPROXIMATIONS OF STOCHASTIC ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS
, 2004
"... We describe and analyze two numerical methods for a linear elliptic problem with stochastic coefficients and homogeneous Dirichlet boundary conditions. Here the aim of the computations is to approximate statistical moments of the solution, and, in particular, we give a priori error estimates for the ..."
Abstract

Cited by 193 (11 self)
 Add to MetaCart
for the computation of the expected value of the solution. The first method generates independent identically distributed approximations of the solution by sampling the coefficients of the equation and using a standard Galerkin finite element variational formulation. The Monte Carlo method then uses
Variable neighborhood search: Principles and applications
, 2001
"... Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS). We present a basic scheme for this purpose, which can easily be implemented using an ..."
Abstract

Cited by 198 (15 self)
 Add to MetaCart
any local search algorithm as a subroutine. Its effectiveness is illustrated by solving several classical combinatorial or global optimization problems. Moreover, several extensions are proposed for solving large problem instances: using VNS within the successive approximation method yields a two
Generalized Galerkin . . .
"... We introduce generalized Galerkin variational integrators, which are a natural generalization of discrete variational mechanics, whereby the discrete action, as opposed to the discrete Lagrangian, is the fundamental object. This is achieved by approximating the action integral with appropriate cho ..."
Abstract
 Add to MetaCart
We introduce generalized Galerkin variational integrators, which are a natural generalization of discrete variational mechanics, whereby the discrete action, as opposed to the discrete Lagrangian, is the fundamental object. This is achieved by approximating the action integral with appropriate
Improved Energy Estimates for Interior Penalty, Constrained and Discontinuous Galerkin Methods for Elliptical Problems
, 1999
"... this paper, we discuss three numerical algorithms for elliptic problems which employ discontinuous approximation spaces. The three methods are called the nonsymmetric interior penalty Galerkin method (NIPG), the nonsymmetric constrained Galerkin (NCG) method, and the discontinuous Galerkin(DG) metho ..."
Abstract

Cited by 104 (16 self)
 Add to MetaCart
this paper, we discuss three numerical algorithms for elliptic problems which employ discontinuous approximation spaces. The three methods are called the nonsymmetric interior penalty Galerkin method (NIPG), the nonsymmetric constrained Galerkin (NCG) method, and the discontinuous Galerkin
Improving Dynamic Voltage Scaling Algorithms with PACE
, 2001
"... This paper addresses algorithms for dynamically varying (scaling) CPU speed and voltage in order to save energy. Such scaling is useful and effective when it is immaterial when a task completes, as long as it meets some deadline. We show how to modify any scaling algorithm to keep performance the sa ..."
Abstract

Cited by 174 (2 self)
 Add to MetaCart
for estimating this distribution and evaluate these methods on a variety of real workloads. We also show how to approximate the optimal schedule with one that changes speed a limited number of times. Using PACE causes very little additional overhead, and yields substantial reductions in CPU energy consumption
Subgrid Stabilization of Galerkin Approximations of Linear Contraction SemiGroups of Class C0 in Hilbert Spaces
, 1999
"... This article presents a stabilizedGalerkin technique for approximating linear contraction semigroups of class C0 in a Hilbert space. The main result of this article is that this technique yields an optimal approximation estimate in the graph norm. The key idea is twofold. First, it consists in int ..."
Abstract
 Add to MetaCart
This article presents a stabilizedGalerkin technique for approximating linear contraction semigroups of class C0 in a Hilbert space. The main result of this article is that this technique yields an optimal approximation estimate in the graph norm. The key idea is twofold. First, it consists
A new modified Galerkin method for the twodimensional NavierStokes equations
, 2008
"... We present a new type of modified Galerkin method. It is a construction with several (inductively defined) levels, that provides approximate solutions of increasing accuracy with every new level. These solutions are constructed as approximations of the so called induced trajectories (notion on which ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a new type of modified Galerkin method. It is a construction with several (inductively defined) levels, that provides approximate solutions of increasing accuracy with every new level. These solutions are constructed as approximations of the so called induced trajectories (notion
Discontinuous Galerkin methods for Friedrichs’ symmetric systems
 I. General theory. SIAM J. Numer. Anal
, 2005
"... Abstract. This paper is the second part of a work attempting to give a unified analysis of Discontinuous Galerkin methods. The setting under scrutiny is that of Friedrichs ’ systems endowed with a particular 2×2 structure in which some of the unknowns can be eliminated to yield a system of secondor ..."
Abstract

Cited by 32 (13 self)
 Add to MetaCart
Abstract. This paper is the second part of a work attempting to give a unified analysis of Discontinuous Galerkin methods. The setting under scrutiny is that of Friedrichs ’ systems endowed with a particular 2×2 structure in which some of the unknowns can be eliminated to yield a system of second
Results 1  10
of
765