نتایج جستجو برای: frameness bound
تعداد نتایج: 179989 فیلتر نتایج به سال:
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
simultaneous estimation of the range and the angle of close emitters usually requires a multidimensional search. this paper proposes analgorithm to improve the position of an element for arrays designed on the basis of some certain or random rules. in the proposed method,one element moves along the same previous direction, maintaining its vertical distance from each source, to reach a constella...
in this paper, we solve a linear system of second-order boundary value problems by using the quadratic b-spline nite el- ement method (fem). the performance of the method is tested on one model problem. comparisons are made with both the analyti- cal solution and some recent results.the obtained numerical results show that the method is ecient.
مسأله بهینه سازی با قیود محدب بعنوان یکی از مسائل مهم و اساسی در بهینه سازی مطرح میباشد. مسائل برنامه ریزی خـطی حالــت خاصی از چنین مسائلی می باشند. در اینجا مسأله بهینه سازی غیرخــطی با قیود محدب، در حالتی بیان میشود که قیود محدب را بصورت قیود کراندار ساده داشته باشیم. یعنی، تنها متغیرهای مسأله از بالا و پایین کراندار باشند. در چند دهه اخیر روش های بسیاری (روش های یکنوا و غیریکنوا ) برای حل ای...
in this letter we have proposed a new regularization scheme to deal with the divergent integralsoccurring in the quantum mechanical problem of calculating the bound state energy of the delta-functionpotential in two and three dimensions. based on the schwinger parameterization technique we argue thatthere are no infinities even in d dimensions. in this way we were able to compare our proposal w...
let = be a non-negative matrix. denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. if we used instead of the purpose of this paper is to establish a hardy type formula for , where is hausdorff matrix and a similar result is also established for where in particular, we apply our results to the cesaro...
This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...
in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید