Recent studies have shown that adaptively regulating the sampling rate results in significant reduction in computational resources in embedded software based control. Selecting a uniform sampling rate for a control loop is robust, but overtly pessimistic for sharing processors among multiple control loops. Fine grained regulation of periodicity achieves better resource utilization, but is hard ...

For many types of integrated circuits, accepting larger failure rates in computations can be used to improve energy efficiency. We study the performance of faulty implementations of certain deep neural networks based on pessimistic and optimistic models of the effect of hardware faults. After identifying the impact of hyperparameters such as the number of layers on robustness, we study the abil...

Data envelopment analysis (DEA) is a method for measuring the relative efficiencies of a set of decision-making units (DMUs) that use multiple inputs to produce multiple outputs. In this paper, we study the measurement of DMU performances in DEA in situations where input and/or output values are given as imprecise data. By imprecise data we mean situations where we only know that the actual val...

In this work we study the problem of QoS routing under inaccurate link state. In particular we compare the efficiency of different link cost functions in a realistic environment where the link state changes cannot be immediately communicated to all the nodes in the network. We also analyse the effects of predicting the present network state when a node must make a routing decision. For this pur...

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...