Results 31 to 40 of about 311,946 (315)
In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The range of allowed probability distributions over the surrounding nodes is restricted using earlier computed bounds.
Leisink, M.A.R., Kappen, H.J.
openaire +6 more sources
Lower Bounds and Upper Bounds for MaxSAT [PDF]
This paper presents several ways to compute lower and upperbounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be ...
Federico Heras +2 more
openaire +2 more sources
Bounded Volume Denominators and Bounded Negativity [PDF]
AbstractIn this paper, we study the question of whether on smooth projective surfaces the denominators in the volumes of big line bundles are bounded. In particular, we investigate how this condition is related to bounded negativity (i.e., the boundedness of self-intersections of irreducible curves).
Bauer, Thomas +3 more
openaire +2 more sources
A Generalized Convexity and Inequalities Involving the Unified Mittag–Leffler Function
This article aims to obtain inequalities containing the unified Mittag–Leffler function which give bounds of integral operators for a generalized convexity. These findings provide generalizations and refinements of many inequalities. By setting values of
Ghulam Farid +4 more
doaj +1 more source
The Letter of Intent: To Be Bound or Not to Be Bound, that Is the Question
The letter of intent is a broadly used tool in different negotiations throughout the entire world. The legal implications of these documents however aren’t always clear. Depending on ‘the content of the letter of intent as a whole, in combination with the factual circumstances’, a letter can be solely morally binding, establish some juridically binding
openaire +2 more sources
Pushing the Bounds of Bounded Optimality and Rationality
Abstract All forms of cognition, whether natural or artificial, are subject to constraints of their computing architecture. This assumption forms the tenet of virtually all general theories of cognition, including those deriving from bounded optimality and bounded rationality.
Sebastian Musslick +1 more
openaire +2 more sources
Bounds on the Signed 2-Independence Number in Graphs
Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G.
Volkmann Lutz
doaj +1 more source
Power bounded and exponentially bounded matrices [PDF]
The authors prove spectral decompositions for the power and exponentially bounded matrices and apply these results to obtain series and integral representations of the Drazin inverse and to describe the asymptotic behaviour of solutions of linear ordinary differential equations, including the singular and singularly perturbed ones.
Koliha, J. J., Straškraba, I.
openaire +1 more source
ABSTRACT Introduction Pre‐dilution online hemodiafiltration (Pre‐HDF) is predominantly used in Japan, whereas post‐dilution online HDF (Post‐HDF) is more common in Europe. An asymmetric cellulose triacetate (ATA) membrane may improve biocompatibility.
Kenji Sakurai +4 more
wiley +1 more source
MSE lower bounds for deterministic parameter estimation [PDF]
This paper presents a simple approach for deriving computable lower bounds on the MSE of deterministic parameter estimators with a clear interpretation of the bounds.
Chaumette, Eric +5 more
core

