The time - cost tradeoff problem is one of the most critical issues in the project scheduling field and so far, a lot of research has been done with a variety of quantitative and qualitative approaches on this subject. In this research, we intend to provide a two - objective mathematical model which balances crash and delay for activities. So that it provides the right tools for decision makers...

This paper shows a vulnerability of the pay-per-click accounting of Google Ads to the attacks of a malicious single agent and proposes a statistical tradeoff-based approach to reduce this vulnerability. The contribution of this paper is a model to calculate the overhead cost per click necessary to protect the subscribers from click spam and a simple algorithm to implement this protection.

A low cost and versatile refraction model for scan-line rendering algorithms is presented. The model is based on the theoretical optical path of a light ray through a generic lens. A Gaussian approximation is then used, together with Blinn and Newell approximation. These expressions lead to a family of approximations with a tradeoff between computational cost and optical precision. In this pape...

This paper presents a method to carry out the register allocation phase of High Level Synthesis with testability considerations. Testability problems are identified and eliminated during this step turning testability/area tradeoff to account. It allows to decrease the cost related to the application of low-level DFT techniques.

This paper shows a vulnerability of the pay-per-click accounting of Google Ads and proposes a statistical tradeoff-based approach to manage this vulnerability. The result of this paper is a model to calculate the overhead cost per click necessary to protect the subscribers and a simple algorithm to implement this protection. Simulations validate the correctness of the model and the economical a...

We obtain an essentially optimal tradeoff between the amortized cost of the three basic priority queue operations insert, delete and find-min in the comparison model. More specifically, we show that A(find-min) = Ω ( n (2 + )A(insert)+A(delete) )

We consider the deadline problem and budget problem of the nonlinear time-cost tradeoff project scheduling model in a series-parallel activity network. We develop fully polynomial time approximation schemes for both problems using K-approximation sets and functions, together with series and parallel reductions.

(QoS) guarantees. For high-density networks, -based routing paradigms to uniformly ate-of-the-art: (i) path-merging leads to a reduction directed towards the border of the network merge into decrease significantly the the cost of the tradeoff for bounding the tencies. Our evaluations demonstrate that by Lifetime, QoS. -load

Minimizing the project cost is a task of project scheduling, and usually is a starting point in the optimization about cost, for example the time-cost tradeoff is to compress the project duration from the one with minimum cost. Project cost can be minimized by letting all activities choose their minimum cost durations only when strict precedence relations exist between activities. But if genera...

Multimedia Proxy caching (MPC) can improve scalability by reducing network load, and maximize delivered quality to heterogenous clients. The notion of delivered quality is a new dimension in design and evaluation of MPC mechanisms that does not exist in traditional web caching. Furthermore, there is a fundamental tradeoff between delivered quality, network load and delay. Previous studies on MP...