In a multi-rate environment fairness is not guaranteed, there is a tradeoff between fairness and throughput in such WLANs. To reduce the tradeoff problem we construct a novel intuitive simplified mathematical model called simplified coefficient of variation (SCV) model, we use SCV model to solve the optimization tradeoff problem through power control of APs, to improve balance between proportio...

This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...

The sequential probability ratio test (SPRT) is asymptotically optimal in the speed versus accuracy tradeoff (SAT) for problems such as visual search (Ch. 3) and scotopic object recognition (Ch. 4), but how close to optimal is SPRT in the nonasymptotic case, i.e. when the cost of error η or the expected response time is small? We numerically compare SPRT and the optimal strategy on the homogene...

We address the problem of multi-agent path planning (MAPP) by taking into account the total energy consumption of all agents, as measured by their cumulative distance travelled. A deterministic meta-heuristic technique called guided iterative prioritized planning (GIPP) is proposed to find good solutions with respect to this cumulative cost measure in a crowded environment. GIPP progressively e...

In this work, we study the so-called leakage minimization problem, within the context of interference alignment (IA). For that purpose, we propose a novel approach based on adaptively controlled perturbations of the leakage function, and show how the latter can be used as a mechanism to control the algorithm’s convergence (and thus tradeoff convergence speed for reliability). Although the propo...

In the following paper, we study the tradeoff between network utility and network lifetime for energyconstrained wireless sensor networks (WSNs). By introducing a weighted factor, we combine these two objectives into a single weighted objective, and we consider rate control and routing in this tradeoff framework simultaneously. First, by using a dual decomposition method, we decompose the trade...

We present BlowFish, a distributed data store that admits a smooth tradeoff between storage and performance for point queries. What makes BlowFish unique is its ability to navigate along this tradeoff curve efficiently at finegrained time scales with low computational overhead. Achieving a smooth and dynamic storage-performance tradeoff enables a wide range of applications. We apply BlowFish to...

Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is known up to a small multiplicative factor for any tradeoff algorithm, false alarms pose a major obstacle in its accurate assessment. In this work, we study the expected pre-image size for an iteration of functions and use the res...

Distributed Constraint Optimization (DCOP) is a key technique for solving agent coordination problems. Because finding cost-minimal DCOP solutions is NP-hard, it is important to develop mechanisms for DCOP search algorithms that trade off their solution costs for smaller runtimes. However, existing tradeoff mechanisms do not provide relative error bounds. In this paper, we introduce three trade...

This paper presents a constraint management methodology, which facilitates tradeoff studies during conceptual design. This approach represents design models as constraints between variables, and uses the resulting constraint network to automatically derive computational procedures for performing userspecified tradeoff studies. By decomposing large constraint networks into smaller pieces that ca...