نتایج جستجو برای: pessimistic efficiency interval
تعداد نتایج: 585376 فیلتر نتایج به سال:
The recent result of Garg et al. (FOCS 2013) changed the previously pessimistic attitude towards general purpose cryptographic obfuscation. Since their first candidate construction, several authors proposed newer and newer schemes with more persuasive security arguments and better efficiency. At the same time, indistinguishability obfuscation proved its extreme usefulness by becoming the basis ...
The current availability of efficient algorithms for decision tree induction makes intricate post-processing techniques worth to be investigated both for efficiency and effectiveness. We study the simplification operator of subtree replacement, also known as grafting, originally implemented in the C4.5 system. We present a parametric bottom-up algorithm integrating grafting with the standard pr...
Price of Anarchy is an oft-used worst-case measure of the inefficiency of non-cooperative decentralized architectures. For a non-cooperative load-balancing game with two classes of servers and for a finite or infinite number of dispatchers, we show that the Price of Anarchy is an overly pessimistic measure that does not reflect the performance obtained in most instances of the problem. We expli...
The combination of Smart Grid and Smart Cities concepts provides municipalities with new capabilities that will lead to better and informed decision making processes. This paper focuses on illustrating key aspects related to a holistic energy efficiency management at a city level, as well as presenting an innovative platform architecture to achieve such objectives. The approach presented focuse...
Transactional Memory (TM) intends to simplify the design and implementation of the sharedmemory data structures used in parallel software. Many Software TM systems are based on writerlocks to protect the data being modified. Such implementations can suffer from the “privatization” problem, in which transactional and non-transactional accesses to the same location can lead to inconsistent result...
This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...
In this paper we present a new method to find simple or multiple roots of functions in a finite interval. In this method using bisection method we can find an interval such that this function is one to one on it, thus we can transform problem of finding roots in this interval into an ordinary differential equation with boundary conditions. By solving this equation using collocation method we ca...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید