نتایج جستجو برای: approximate duality
تعداد نتایج: 96651 فیلتر نتایج به سال:
We argue that the evolution of coloured partons into colour-singlet hadrons has approximate factorization into an extended parton-shower phase and a colour-singlet resonance–pole phase. The amplitude for the conversion of colour connected partons into hadrons necessarily resembles Regge-pole amplitudes since qq̄ resonance amplitudes and Regge-pole amplitudes are related by duality. A ‘Regge-casc...
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
In this work, we present an efficient framework to generate a motion trajectory of a robot that has a high degree of freedom (e.g., a humanoid robot). High-dimensionality of the robot configuration space often leads to difficulties in utilizing the widely-used motion planning algorithms because the volume of the decision space increases exponentially with the number of dimensions. To handle com...
چکیده ندارد.
This paper discusses how two classes of approximate computation algorithms can be adapted, in a modular fashion, to achieve exact statistical inference from differentially private data products. Considered are Bayesian for inference, and Monte Carlo Expectation-Maximization likelihood inference. Up error, these is with respect the joint specification both analyst's original model, curator's dif...
A new notion of higher-order weakly generalized adjacent epiderivative for a set-valued map is introduced. By virtue of the epiderivative and weak minimality, a higher-order Mond-Weir type dual problem and a higher-order Wolfe type dual problem are introduced for a constrained setvalued optimization problem, respectively. Then, corresponding weak duality, strong duality and converse duality the...
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
we study the notion of bounded approximate connes-amenability for dual banach algebras and characterize this type of algebras in terms of approximate diagonals. we show that bounded approximate connes-amenability of dual banach algebras forces them to be unital. for a separable dual banach algebra, we prove that bounded approximate connes-amenability implies sequential approximate...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید