نتایج جستجو برای: ε constraint approach

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

2015
Lisheng Ma Xiaohong Jiang Bin Wu Tarik Taleb

Data backup in data center networks (DCNs) is critical to minimize the data loss under disaster. This paper considers the cost-efficient data backup for DCNs against a disaster with ε early warning time. Given geo-distributed DCNs and such a ε-time early warning disaster, we investigate the issue of how to back up the data in DCN nodes under risk to other safe DCN nodes within the ε early warni...

2012
Tetsuyuki Takahama Setsuko Sakai

The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the ε level comparison, which compares search points based on the pair of objective value and constraint violation of them. We have proposed the ε constrained differential evolution εDE, which is the combination of the ε constrained...

2009
Luca Trevisan LUCA TREVISAN

A unique game is a type of constraint satisfaction problem with two variables per constraint. The value of a unique game is the fraction of the constraints satisfied by an optimal solution. Khot (STOC’02) conjectured that for arbitrarily small γ,ε > 0 it is NPhard to distinguish games of value smaller than γ from games of value larger than 1− ε . Several recent inapproximability results rely on...

Journal: :journal of optimization in industrial engineering 2013
mahdi bashiri hamidreza rezaei

in this paper, a novel approach for multi response optimization is presented. in the proposed approach, response variables in treatments combination occur with a certain probability. moreover, we assume that each treatment has a network style. because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...

Journal: :EURASIP J. Wireless Comm. and Networking 2010
Giordano Fusco Himanshu Gupta

Wireless sensors rely on battery power, and in many applications it is difficult or prohibitive to replace them. Hence, in order to prolongate the system’s lifetime, some sensors can be kept inactive while others perform all the tasks. In this paper, we study the k-coverage problem of activating the minimum number of sensors to ensure that every point in the area is covered by at least k sensor...

2015
ZHEN LEI THOMAS C. SIDERIS YI ZHOU Fang-hua Lin

We consider the Cauchy problem for 2-D incompressible isotropic elastodynamics. Standard energy methods yield local solutions on a time interval [0, T/ε] for initial data of the form εU0, where T depends only on some Sobolev norm of U0. We show that for such data there exists a unique solution on a time interval [0, exp T/ε], provided that ε is sufficiently small. This is achieved by careful co...

Journal: :IEEE transactions on signal processing : a publication of the IEEE Signal Processing Society 2013
Behtash Babadi Demba Ba Patrick L Purdon Emery N Brown

In this paper, we study the theoretical properties of a class of iteratively re-weighted least squares (IRLS) algorithms for sparse signal recovery in the presence of noise. We demonstrate a one-to-one correspondence between this class of algorithms and a class of Expectation-Maximization (EM) algorithms for constrained maximum likelihood estimation under a Gaussian scale mixture (GSM) distribu...

Journal: :EURASIP J. Wireless Comm. and Networking 2010
Beatriz Soret M. Carmen Aguayo-Torres José T. Entrambasaguas

This work addresses the limits on the information that can be transmitted over the wireless channel under the conditions stated by the MAC layer: a selected scheduling discipline and an ensured level of QoS. Based on the effective bandwidth theory, the joint influence of the channel fading, the data outsourcing process, and the scheduling discipline in the QoS metrics are studied. We obtain a c...

Journal: :Random Struct. Algorithms 2014
Emmanuel Abbe Andrea Montanari

Let Z(F ) be the number of solutions of a random k-satisfiability formula F with n variables and clause density α. Assume that the probability that F is unsatisfiable is O(1/ log(n)) for some δ > 0. We show that (possibly excluding a countable set of ‘exceptional’ α’s) the normalized logarithm of the number of solutions concentrates, i.e., there exists a non-random function α 7→ φs(α) such that...

Journal: :Aerospace 2023

In this paper, we consider the relative motion of a follower spacecraft orbiting Earth in near circular orbit with respect to leader spacecraft. The orbital motion-control problem is studied here. order allow succeed its target maneuver, proposed multi-objective optimization method solve problem. Firstly, Hill–Clohessy–Wiltshire equation was used describe continuous system. Then, system discret...

2004200520062007200820092010201120122013201420152016201720182019202020212022202304000080000

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

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