نتایج جستجو برای: stopping criteria
تعداد نتایج: 270889 فیلتر نتایج به سال:
Stopping-time Banach spaces is a collective term for the class of eventually null integrable processes that are defined in terms behaviour stopping times with respect to some fixed filtration. From point view space theory, these many regards resemble classical such as L1 or C(Δ), but unlike these, they do have unconditional bases. In present paper, we study canonical bases stopping-time relatio...
BACKGROUND India has more than 5.7 million people infected with human immunodeficiency virus (HIV). In 2004, the Indian government began providing antiretroviral therapy (ART), and there are now an estimated 56 500 people receiving ART. OBJECTIVE To project the life expectancy, cost, and cost-effectiveness associated with different strategies for using ART in India, to inform treatment progra...
We combine linear algebra techniques with finite element techniques to obtain a reliable stopping cri-terion for Krylov method based algorithms. The Conjugate Gradient method has for a long time beensuccessfully used in the solution of the symmetric and positive definite systems obtained from thefinite-element approximation of self-adjoint elliptic partial differential equations...
This paper proposes a new stopping criterion for automatic image segmentation based on region merging. The criterion is dependent on image content itself and when combined with the recently proposed approaches to syntactic segmentation can produce results aligned with the most salient semantic regions/objects present in the scene across heterogeneous image collections. The method identifies a s...
Due to the growing complexity of todays technical systems optimization is becoming an important issue within the design phase. The applicability of optimization algorithms in automatic design processes is strongly dependent on the stopping criterion. It is important that the optimum is reliably found but furthermore no time or computational resources should be wasted. Therefore a run time analy...
BACKGROUND In phase II trials of cytotoxic agents, a multinomial phase II design incorporating early progression and response end points was shown to perform more efficiently than designs based only on response. We undertook a study to evaluate the performance of these designs in trials of targeted agents using the actual phase II data. PATIENTS AND METHODS Using best response data from seque...
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید