نتایج جستجو برای: m fuzzifying convexity

تعداد نتایج: 547024  

2013
Alexandru Kristály Szilárd Nagy

We study the existence of Stackelberg equilibrium points on strategy sets which are geodesic convex in certain Riemannian manifolds by using metric projection arguments. The present results extend those obtained in Nagy [J. Global Optimization (2013)] in the Euclidean context.

Journal: :Indiana University Mathematics Journal 1974

Journal: :CoRR 2008
Alexey S. Tarasov

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected"edge"unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of L).

Journal: :IEEE Trans. Communications 2016
Ni Ding Parastoo Sadeghi Rodney A. Kennedy

This paper considers a cross-layer adaptive modulation system that is modeled as a Markov decision process (MDP). We study how to utilize the monotonicity of the optimal transmission policy to relieve the computational complexity of dynamic programming (DP). In this system, a scheduler controls the bit rate of the m-quadrature amplitude modulation (m-QAM) in order to minimize the long-term loss...

Journal: :Int. Arab J. Inf. Technol. 2006
Adnan Shaout Brady W. King Luke A. Reisner

This paper presents the design and implementation of a real-time fuzzy-based artificial intelligence system for an interactive game. The chosen game is a remake of Pac-Man in which the opponents are BDI-style intelligent agents. The components of the system and the methods used in fuzzifying the game’s rules and variables are discussed. In addition, comparisons are drawn between the proposed fu...

Journal: :Journal of Japan Society for Fuzzy Theory and Systems 1993

Journal: :Journal of the Egyptian Mathematical Society 2016

Journal: :J. Multivariate Analysis 2009
Kengo Kato

The convexity arguments developed by Pollard [D. Pollard, Asymptotics for least absolute deviation regression estimators, Econometric Theory 7 (1991) 186–199], Hjort and Pollard [N.L. Hjort, D. Pollard, Asymptotics for minimizers of convex processes, 1993 (unpublished manuscript)], and Geyer [C.J. Geyer, On the asymptotics of convex stochastic optimization, 1996 (unpublished manuscript)] are no...

2005
Fred Richman

It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید