نتایج جستجو برای: upper bound technique
تعداد نتایج: 950797 فیلتر نتایج به سال:
Here, we propose a method of estimation of the derivatives of probability density based wavelets methods for a sequence of m−dependent random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for the such estimators.
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
In branch and bound algorithms in constrained global optimization, a sharp upper bound on the global optimum is important for the overall efficiency of the branch and bound process. Software to find local optimizers, using floating point arithmetic, often computes an approximately feasible point close to an actual global optimizer. Not mathematically rigorous algorithms can simply evaluate the ...
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q of Q, as it is for example in Shor’s order finding algorithm. In this setting we will prove a Ω(log 1/ǫ) lower bound for the number of applications of Q1 , Q2 , . . .. This bound is tigh...
In this research, robotic cell scheduling problem with three CNC machines and with an operation on each machine with the purpose of optimizing manufacturing cost and time in S1 cycle has been investigated. To obtain the optimal total cost of production has been used the optimal processing time on machine operation. In this research, robotic cell scheduling is studied in three different situatio...
In this paper we derive a posteriori error estimates for the heat equation. The time discretization strategy is based on a θ-method and the mesh used for each time-slab is independent of the mesh used for the previous time-slab. The novelty of this paper is an upper bound for the error caused by the coarsening of the mesh used for computing the solution in the previous time-slab. The technique ...
Optimizing the input covariance matrix of a MIMO system with partial channel-structure feedback is an important issue to fully exploit the channel capacity. Efficient design of the optimal input covariance matrix, however, remains unavailable although its eigenvector structure was clearly revealed. In this paper, we obtain an upper bound of the capacity by matrix operation and concavity of the ...
An upper bound method for the process of plane strain extrusion through a wedge-shaped die is derived. A technique for constructing a kinematically admissible velocity field satisfying the exact asymptotic singular behavior of real velocity fields in the vicinity of maximum friction surfaces (the friction stress at sliding is equal to the shear yield stress on such surfaces) is described. Two s...
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...
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید