نتایج جستجو برای: ansari
تعداد نتایج: 411 فیلتر نتایج به سال:
Because of their applications in economics, game theory, mathematical physics, operations research and other areas, many classes of vector variational inequalities were intensively studied. For existence of solutions, resolution methods or equivalence with equilibrium and optimization problems see, for example, [11], [14], [15], [19], [17] and the references therein. For the study of variationa...
In this paper, we use the concept of $C$-class functions introduced by Ansari [4] to prove the existence and uniqueness of common fixed point for self-mappings in modular spaces of integral inequality. Our results extended and generalized previous known results in this direction.
Ebrahim Ansari ([email protected]) et al. 2017. Extracting bilingual per-sian italian lexicon from comparable corpora using different types of seed dictionaries. In " Applications of Comparable Corpora " edited book Berlin Linguistic Press (ed.). Bilingual dictionaries are very important in various fields of natural language processing. In recent years, research on extracting new bilingual lex...
(1) x0 ∈ K such that c1 ≤ f(x0, y) ≤ c2, for all y ∈ K, where K is a given set, f : K × K → R is a given function and c1 and c2 two real numbers such that c1 ≤ c2. If K is a nonempty closed subset in a locally convex semi-reflexive topological vector space, then the problem (1) is problem by Isac, Sehgal and Singh [16] (Open Problem 2). In [20], Li gave the answer of this problem by introducing...
and Applied Analysis 3 Throughout this paper, all topological spaces are assumed to be Hausdorff. In order to prove our main theorems, we need the following results. Lemma 2.1. Let X and Y be two topological spaces and G : X → 2 a set-valued mapping with nonempty values. Then the following conditions are equivalent: I G has the compactly local intersection property, II for each nonempty compact...
In this paper, a Broadcast Scheduling Problem (bsp) in a time division multiple access (TDMA) ad hoc network is analyzed in terms of its computational complexity. In a TDMA frame, time is divided into equal length transmission slots in which messages are scheduled. The objective of the considered version of the bsp is to provide a collision free broadcast schedule which minimizes the total fram...
By R. Hehlmann, H. Heimpel, J. Hasford, H.J. Kolb, H. Pralle, D.K. Hossfeld, W. QueiBer, H. Lbffler, B. Heinze, A. Georgii, P.v. Wussow, C. Bartram, M. GrieBhammer, L. Bergmann, U. Essers, C. Falge, A. Hochhaus, U. QueiBer, C. Sick, P. Meyer, N. Schmitz, K. Verpoort, H. Eimermacher, F. Walther, M. Westerhausen, U.R. Kleeberg, A. Heilein, A. Kabisch. C. Barz, R. Zimmermann, G. Meuret, A. Tichell...
Edward M. Hubbard,1 Ilka Diester,2 Jessica F. Cantlon,3 Daniel Ansari,4 Filip van Opstal,5 and Vanessa Troiani6 1INSERM Unité 562, Cognitive Neuroimaging, CEA/SAC/DSV/I2BM/NeuroSpin, 91191 Gif-Sur-Yvette, France, 2Department of Animal Physiology, University of Tuebingen, 72076 Tuebingen, Germany, 3Department of Psychology and Neuroscience, Center for Cognitive Neuroscience, Duke University, Dur...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید