نتایج جستجو برای: minimal solution
تعداد نتایج: 606440 فیلتر نتایج به سال:
In a 1944 book that started game theory (and mathematical approach to conflict resolution), von Neumann and Morgenstern proposed the notion of a solution. When the situation changes, the old solution is often no longer a solution, so it needs to be updated. In practical applications, it is usually desirable to keep the solution change “minimal” in some reasonable sense. We show that for a seemi...
In a 1944 book that started game theory (and mathematical approach to conflict resolution), von Neumann and Morgenstern proposed the notion of a solution. When the situation changes, the old solution is often no longer a solution, so it needs to be updated. In practical applications, it is usually desirable to keep the solution change “minimal” in some reasonable sense. We show that for a seemi...
We developed minimal perfect hash functions for a variety of datasets using the probabilistic process of simulated annealing (SA). The SA solution structure is a tree representing an annealed program (algorithm). This solution structure is similar to the structure used in genetic programming. When executed, the SA program produces multiple hash functions for the given data set. An initial hash ...
In this note, we prove that the minimal and maximal solution maps associated to elliptic quasi-variational inequalities of obstacle type are directionally differentiable with respect forcing term for directions signed. Along way, show solutions can be seen as monotone limits certain variational aforementioned directional derivatives also characterised sequences inequalities. We conclude paper s...
Correction for ‘Large-area printed low-voltage organic thin film transistors via minimal-solution bar-coating’ by Sujin Sung et al., J. Mater. Chem. C, 2020, 8, 15112–15118, DOI: 10.1039/D0TC03089A.
We classify generic systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the single solution of such a system.
krein [1] mentioned that for each pd equation we have two extreme operators, one is the minimal in which solution and its derivatives on the boundary are zero, the other one is the maximal operator in which there is no prescribed boundary conditions. they claim it is not possible to have a related boundary value problem for an arbitrarily chosen operator in between. they have only considered lo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید