We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial re...

A new computational method based on Wilson wavelets is proposed for solving a class of nonlinear stochastic It^{o}-Volterra integral equations. To do this a new stochastic operational matrix of It^{o} integration for Wilson wavelets is obtained. Block pulse functions (BPFs) and collocation method are used to generate a process to forming this matrix. Using these basis functions and their operat...

In most stochastic inventory models, such as continuous review models and periodic review models, it has been assumed that the stockout period during a cycle is small enough to be neglected so that the average number of cycles per year can be approximated as D/Q, where D is the average annual demand and Q is the order quantity. This assumption makes the problem more tactable, but it should not ...

In most stochastic inventory models, such as continuous review models and periodic review models, it has been assumed that the stockout period during a cycle is small enough to be neglected so that the average number of cycles per year can be approximated as D/Q, where D is the average annual demand and Q is the order quantity. This assumption makes the problem more tactable, but it should not ...

Although cloud computing has increased in popularity, datacenter utilization has remained for the most part low. This is in part due to the interference that comes as a result of applications sharing hardware and software resources. When interference occurs, the resources of at least one co-scheduled application need to be reduced forcing it to take a performance penalty. In current proposals, ...

How to preserve users’ privacy while supporting high-utility analytics for low-latency stream processing? To answer this question: we describe the design, implementation and evaluation of PRIVAPPROX, a data analytics system for privacy-preserving stream processing. PRIVAPPROX provides three properties: (i) Privacy: zero-knowledge privacy guarantees for users, a privacy bound tighter than the st...

Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier‎. ‎This paper applies an evolutionary optimization scheme‎, ‎inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...

The numerical solution of a large scale linear response eigenvalue problem is often accomplished by computing a pair of deflating subspaces associated with the interested part of the spectrum. This paper is concerned with the backward perturbation analysis for a given pair of approximate deflating subspaces or an approximate eigenquaternary. Various optimal backward perturbation bounds are obta...

Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area and power, makes the identification of the most suitable approximate multiplier quite challenging. In this paper, we identify three major decision making fac...