Distributed storage systems are mainly justified due to the limited amount of storage capacity and improving the reliability through distributing data over multiple storage nodes. On the other hand, it may happen the data is stored in unreliable nodes, while it is desired the end user to have a reliable access to the stored data. So, in an event that a node is damaged, to prevent the system rel...

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

Abstract We revisit the deadline version of discrete time-cost tradeoff problem for special case bounded depth. Such instances occur example in VLSI design. The depth an instance is number jobs a longest chain and denoted by d . prove new upper lower bounds on approximability. First we observe that can be regarded as finding minimum-weight vertex cover -partite hypergraph. Next, study natural L...

This paper investigates a risk-averse inventory model by balancing the expected profit and conditional value-at-risk (CVaR) in a newsvendor model setting. We find out that: i) The optimal order quantity is increasing in the shortage cost for both the CVaR only criterion and the tradeoff objective. ii) For the case of zero shortage cost, the optimal order quantity to the CVaR criterion or tradeo...

Time memory tradeoff algorithms are tools for inverting oneway functions, and they are often used to recover passwords from unsalted password hashes. There are many publicly known tradeoff algorithms, and the rainbow tradeoff is widely believed to be the best algorithm. This work provides an accurate complexity analysis of the fuzzy rainbow tradeoff algorithm, which has not yet received much at...

In this paper we discuss how communication can be used advantageously for cooperative navigation in sparse environments. Specifically, we analyze the tradeoff between the cost of communication cost and the efficient completion of the navigation task. We make use of a partially observable Markov decision process (POMDP) to model the navigation task, since this model allows to explicitly consider...