Results 31 to 40 of about 286,804 (242)
Pushing the Bounds of Bounded Optimality and Rationality
AbstractAll 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 +3 more sources
Background/Objectives: Autism Spectrum Disorder (ASD) are neurodevelopmental disorders marked by challenges in social interaction, communication, and repetitive behaviors.
Kierra Pietramala +3 more
doaj +1 more source
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
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
Decay of a bound muon to a bound electron [PDF]
When a muon bound in an atom decays, there is a small probability that the daughter electron remains bound. That probability is evaluated. Surprisingly, a significant part of the rate is contributed by the negative energy component of the wave function, neglected in a previous study. A simple integral representation of the rate is presented.
M. Jamil Aslam +3 more
openaire +3 more sources
Intersection bounds: estimation and inference [PDF]
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially
Rosen, A.M. +8 more
core +1 more source
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
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
ABSTRACT Background The Standards for Psychosocial Care for Children with Cancer and Their Families (“Standards”) are evidence‐based guidelines for psychosocial care in pediatric oncology. Care related to the three “Asking and Monitoring” Standards—Assessment of Psychosocial Needs, Assessment of Financial Needs, and Monitoring Neurocognitive Problems ...
Julia B. Tager +8 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

