نتایج جستجو برای: problem of i
تعداد نتایج: 21386285 فیلتر نتایج به سال:
In decision theory, mathematical analysis shows that once the sampling distributions, loss function, and sample are speci ed, the only remaining basis for a choice among di erent admissible decisions lies in the prior probabilities. Therefore, the logical foundations of decision theory cannot be put in fully satisfactory form until the old problem of arbitrariness (sometimes called \subjectiven...
The unsteady flow of a visco-elastic Maxwell fluid through a rectilinear pipe having its cross-section as a parallelogram under the influence of a axial pressure gradient (I) varying linearly with time , and (II) decreasing exponentially with time has been discussed in the present paper. Variables separable and Laplace transform methods have been used to solve the problem.
This problem of hell is a specific form of the problem of evil. The possibility that perhaps a great number of people will end up in an eternal hell is a problem for the Christian who also confesses faith in an omnipotent, omniscient, and omnibenevolent God. In this paper, I shall introduce issuantist views of hell and show that the basic formulations of this perspective do not provide an adeq...
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
Background: With increase in the age there is an increase in both the incidence of hypothyroidism and cardiovascular diseases. We wanted to see whether hypothyroidism caused false positivity in patients who did not have cardiovascular problems or not. In hypothyroid state, creatine kinase leaks into blood. Troponin I in small amount persists in Cytosolic pool (the same site of creatine kina...
In the k -cut problem, we want to find lowest-weight set of edges whose deletion breaks a given (multi)graph into connected components. Algorithms Karger and Stein can solve this in roughly O ( n 2k ) time. However, lower bounds from conjectures about -clique problem imply that ? (1- o (1)) time is likely needed. Recent results Gupta, Lee, Li have new algorithms for general 1.98k + O(1) time, a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید