Results 41 to 50 of about 69,419 (165)
Approximate inference techniques with expectation constraints [PDF]
This paper discusses inference problems in probabilistic graphical models that often occur in a machine learning setting. In particular it presents a unified view of several recently proposed approximation schemes. Expectation consistent approximations and expectation propagation are both shown to be related to Bethe free energies with weak consistency
Heskes, T.M. +4 more
openaire +4 more sources
We study a boundary value problem for nonlinear partial differential equations of the hyperbolic type on the plain in a domain with a complex boundary.
Vasyl Marynets +2 more
doaj +1 more source
Approximation with interpolatory constraints
AbstractBest approximation with interpolatory constraints is considered. A sufficient condition for an approximating function to be a unique best approximation is presented. A necessary condition is deduced if uniqueness holds.
openaire +3 more sources
Approximation algorithms for channel assignment with constraints
Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interference. An algorithm for the channel assignment problem must assign as many channels as the weight indicates to every node, such that any two channels assigned to the same node satisfy the co-site ...
Janssen, Jeannette, Narayanan, Lata
openaire +2 more sources
Researches on the problem of link disjoint paths pair with QoS constraints
The problem of link disjoint paths pair with QoS constraints was discussed.Two routing models about link dis-joint optimal paths pair with QoS constraints were constructed.First it proved that the problem of link disjoint paths pair in the undirected ...
ZHANG Pin 1 +3 more
doaj +2 more sources
STABILITY OF MOTION OF RAILWAY VEHICLES DESCRIBED WITH LAGRANGE EQUATIONS OF THE FIRST KIND
Purpose. The article aims to estimate the stability of the railway vehicle motion, whose oscillations are described by Lagrange equations of the first kind under the assumption that there are no nonlinearities with discontinuities of the right-hand sides.
A. G. Reidemeister, S. I. Levytska
doaj +1 more source
Finite-Dimensional Gaussian Approximation with Linear Inequality Constraints [PDF]
Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the finite-dimensional Gaussian approach from Maatouk and Bay (2017) which can satisfy inequality conditions everywhere (either boundedness, monotonicity or convexity).
López-Lopera, Andrés F. +3 more
openaire +4 more sources
A cost function approximation method for dynamic vehicle routing with docking and LIFO constraints
In this paper, we study a dynamic pickup and delivery problem with docking constraints. There is a homogeneous fleet of vehicles to serve pickup-and-delivery requests at given locations.
Markó Horváth +2 more
doaj +1 more source
Study on multi-objective nonlinear programming in optimization of the rough interval constraints
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two ...
Hamiden Abdelwahed Khalifa
doaj
Based on the deterministic description of batch culture expressed in form of switched ordinary differential equations, we introduce a switched stochastic counterpart system with initial state difference together with uncertain switching instants and ...
Jinlong Yuan +4 more
doaj +1 more source

