نتایج جستجو برای: common solution
تعداد نتایج: 1122862 فیلتر نتایج به سال:
There are games which have a solution only if some of the assumptions of the theory of the game are not common knowledge among the players. In particular, assuming that players' rationality is common knowledge among them makes the theory inconsistent at some information set, and therefore the players become unable to use it to predict each other's strategy choices. In this paper I show that (a)...
Cross-Language Access to Recorded Speech in the MALACH Project . . . . . . . . . . . . . 57 Douglas W. Oard, Dina Demner-Fushman (University of Maryland, USA), Jan Hajič (Charles University, Prague, Czech Republic), Bhuvana Ramabhadran (IBM T. J. Watson Research Center, USA), Samuel Gustman (Survivors of the Shoah Visual History Foundation, Los Angeles, USA), William J. Byrne (Johns Hopkins Uni...
we introduce a general implicit algorithm for finding a common element of the set of solutions of systems of equilibrium problems and the set of common fixed points of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings. then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...
<p style='text-indent:20px;'>In this paper, we study the problem of finding a common element set solutions system monotone inclusion problems and fixed points finite family generalized demimetric mappings in Hilbert spaces. We propose new efficient algorithm for solving problem. Our method relies on inertial algorithm, Tseng's splitting viscosity algorithm. Strong convergence analysis pro...
In this paper, an iterative scheme for finding common solutions of the set fixed points a pair asymptotically quasi-nonexpansive mapping and minimizers minimization problem is constructed. Using idea jointly demicloseness principle, strong convergence results are achieved without imposing any compactness condition on space or operator. Our improve, extend generalize many important in literature.
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید