نتایج جستجو برای: augmented epsilon constraint
تعداد نتایج: 139014 فیلتر نتایج به سال:
In the directed Steiner tree (DST) problem, we are given an $n$-vertex edge-weighted graph, a root $r$, and collection of $k$ terminal nodes. Our goal is to find minimum-cost subgraph that contains path from $r$ every terminal. We present $O(\log^2 k/\log\log{k})$-approximation algorithm for DST runs in quasi-polynomial time, i.e., time $n^{{poly}\log (k)}$. By assuming projection game conjectu...
Satisfiability problem for modal logic K with quantifier-free Presburger and regularity constraints (EML) is known to be pspace-complete. In this paper, we consider its extension with nonregular constraints, and more specifically those expressed by visibly pushdown languages (VPL). This class of languages behaves nicely, in particular when combined with Propositional Dynamic Logic (PDL). By ext...
This paper is concerned with the variance-constrained state estimation problem for a class of networked multi-rate systems (NMSs) with network-induced probabilistic sensor failures and measurement quantization. The stochastic characteristics of the sensor failures are governed by mutually independent random variables over the interval [0, 1]. By applying the lifting technique, an augmented syst...
Variational Bayes (VB), also known as independent mean-field approximation, has become a popular method for Bayesian network inference in recent years. Its application is vast, e.g. in neural network, compressed sensing, clustering, etc. to name just a few. In this paper, the independence constraint in VB will be relaxed to a conditional constraint class, called copula in statistics. Since a jo...
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Such domains often restrict their attention of TVPI constraints which are systems of constraints where each constraint involves, at most, two variables. This technical report addresses the problem of deriving an incremental...
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an NP-complete task in general, it is believed that efficiency can be significantly improved by exploiting the characteristics of the problem. In this paper, we present a solution synthesis algorithm called ω-CDGT which is...
A role for immunoglobulin E and its high affinity receptor (Fc epsilon RI) in the control of bacterial pathogenicity and intestinal inflammation has been suggested, but relevant animal models are lacking. Here we compare transgenic mice expressing a humanized Fc epsilon RI (hFc epsilon RI), with a cell distribution similar to that in humans, to Fc epsilon RI-deficient animals. In hFc epsilon RI...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید