نتایج جستجو برای: convex power condensing map

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

Journal: :Electronic Notes in Theoretical Computer Science 2000

2017
DIVYA PRAKASH

Inorder to enhance the capacity and output of a downlink orthogonal frequency division multiple access(OFDMA) network, it is essential to perform appropriate resource allocation. Correct resource allocation suggests that finding best subchannel and power allocation for each and every user. Therefore here associate algorithm is proposed to attain this. Initial of all sub-channel allocation is pe...

Journal: :IEEE Transactions on Control of Network Systems 2019

Journal: :Mathematical Social Sciences 1998

Journal: :CoRR 2017
Zhuang Tian WenChuan Wu

Convex relaxation methods have been studied and used extensively to obtain an optimal solution to the optimal power flow (OPF) problem. Meanwhile, convex relaxed power flow equations are also prerequisites for efficiently solving a wide range of problems in power systems including mixed-integer nonlinear programming (MINLP) and distributed optimization. When the exactness of convex relaxations ...

Journal: :J. Logic & Analysis 2009
Isaac Goldbring

We show how to construct the nonstandard hull of certain infinite-dimensional Lie algebras in order to generalize a theorem of Pestov on the enlargeability of Banach-Lie algebras. In the process, we consider a nonstandard smoothness condition on functions between locally convex spaces to ensure that the induced function between the nonstandard hulls is smooth. We also discuss some conditions on...

2008
G. N. GALANIS T. G. BHASKAR V. LAKSHMIKANTHAM

It is known that a Fréchet space F can be realized as a projective limit of a sequence of Banach spaces Ei. The space Kc(F) of all compact, convex subsets of a Fréchet space, F, is realized as a projective limit of the semilinear metric spacesKc(E). Using the notion of Hukuhara derivative for maps with values inKc(F), we prove the local and global existence theorems for an initial value problem...

Journal: :J. Global Optimization 2013
Hugo Leiva Nelson Merentes Kazimierz Nikodem José Luis Sánchez

We introduce the notion of strongly t-convex set-valued maps and present some properties of it. In particular, a Bernstein–Doetsch and Sierpiński-type theorems for strongly midconvex set-valued maps, as well as a Kuhn-type result are obtained. A representation of strongly t-convex set-valued maps in inner product spaces and a characterization of inner product spaces involving this representatio...

Journal: :CoRR 2017
Bi-Qiang Mu Tianshi Chen

Input design is an important issue for classical system identification methods but has not been investigated for the kernel-based regularization method (KRM) until very recently. In this paper, we consider in the time domain the input design problem of KRMs for LTI system identification. Different from the recent result, we adopt a Bayesian perspective and in particular make use of scalar measu...

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

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