نتایج جستجو برای: subject constraint

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

Journal: :Automatica 2022

We give the explicit solution of optimal control problem which consists in minimizing epidemic peak SIR model when is an attenuation factor infectious rate, subject to a L1 constraint on represents budget constraint. The strategy given as feedback singular arc maintaining infected population at constant level until immunity threshold reached, and no intervention outside arc. discuss compare thi...

Journal: :Inf. Sci. 2014
De-Chao Li Sheng-Ling Geng

This paper aims to solve the problem of multiple-objective linear optimization model subject to a system of inf-! composition fuzzy relation equations, where ! is R-, Sor QL-implications generated by continuous Archimedean t-norm (s-norm). Since the feasible domain of inf-! relation equations constraint is nonconvex, these traditional mathematical programming techniques may have difficulty in c...

2011
Mostafa Khoshnevisan

by Mostafa Khoshnevisan It is known that adaptive power and rate allocation is a useful technique for combating channel variations induced by multipath fading in wireless systems. We consider several fading channel models for which we aim to optimize a performance metric subject to various power and energy constraints. First, we find the general structure of optimal or suboptimal power policies...

Journal: :CoRR 2017
Hailong Huang Andrey V. Savkin Ming Ding Mohamed Ali Kâafar

Modern wireless traffic demand pushes Internet Service Providers to develop effective strategies to improve user experience. Since deploying dense Base Stations (BSs) is not cost efficient, an alternative is to deploy autonomous drones to supplement existing BSs. A street graph is adopted to represent the area of interest. The outdoor User Equipments (UEs) to be served locate near streets and t...

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

2017
Katrina Ligett Seth Neel Aaron Roth Bo Waggoner Steven Z. Wu

Traditional approaches to differential privacy assume a fixed privacy requirement ε for a computation, and attempt to maximize the accuracy of the computation subject to the privacy constraint. As differential privacy is increasingly deployed in practical settings, it may often be that there is instead a fixed accuracy requirement for a given computation and the data analyst would like to maxim...

Journal: :IEEE Trans. Information Theory 1987
Brian L. Hughes Prakash Narayan

The arbitrarily varying channel (AVC) can be interpreted as a model of a channel jammed by an intelligent and unpredictable adversary. We investigate the asymptotic reliability of optimal random block codes on Gaussian arbitrarily varying channels (GAVC’s). A GAVC is a discrete-time memoryless Gaussian channel with input power constraint PT and noise power N,, which is further corrupted by an a...

2004
Stefan M. Stefanov

where mj > 0, dj > 0, j ∈ J, x = (xj)j∈J, and J def = {1, . . . , n}. Denote this problem by (Q≤) in the first case (problem (1.1)–(1.3) with inequality “≤” constraint (1.2)), by (Q) in the second case (problem (1.1)–(1.3) with equality constraint (1.2)), and by (Q≥) in the third case (problem (1.1)–(1.3) with inequality “≥” constraint (1.2)). Denote by X≤, X, X≥ the feasible set (1.2)–(1.3) in...

2002
Takao Watanabe

This paper considers the decentralized turbine-governor control design for the damping of low-frequency, inter-area oscillations in electric power systems. A time-varying model that explains oscillations caused by parametric resonance is employed to design a controller. A robust turbine-governor controller design is presented on the basis of the model. Furthermore, a basic idea for incorporatin...

Journal: :Risk and Decision Analysis 2013
Sheung Chi Phillip Yam Siu-Pang Yung J. H. Zhou

In this paper, we study a mean-variance portfolio selection problem that has a probabilistic benchmark constraint. This constraint changes the problem into a nonconvex one but could be solved via the method of Lagrange multipliers, whose existence is crucial in the solution.

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

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