Algorithms for planning working time under interval uncertainty
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for Computing Statistics under Interval Uncertainty: An Overview
Computing statistics is important. In many engineering applications, we are interested in computing statistics. For example, in environmental analysis, we observe a pollution level x(t) in a lake at different moments of time t, and we would like to estimate standard statistical characteristics such as mean, variance, autocorrelation, correlation with other measurements. For each of these charac...
متن کاملEfficient algorithms for heavy-tail analysis under interval uncertainty
Most applications of statistics to science and engineering are based on the assumption that the corresponding random variables are normally distributed, i.e., distributed according to Gaussian law in which the probability density function ρ(x) exponentially decreases with x: ρ(x) ∼ exp(−k · x). Normal distributions indeed frequently occur in practice. However, there are also many practical situ...
متن کاملEfficient Algorithms for Synchronizing Localization Sensors under Interval Uncertainty∗
In this paper, we show that a practical need for synchronization of localization sensors leads to an interval-uncertainty problem. In principle, this problem can be solved by using the general linear programming algorithms, but this would take a long time – and this time is not easy to decrease, e.g., by parallelization since linear programming is known to be provably hard to parallelize. To so...
متن کاملWorking Time and Employment Under Uncertainty
The standard literature on working time has modelled the decisions of firms in a deterministic framework in which firms can choose between employment and overtime (given mandated standard hours). Contrary to this approach, we consider the impact of uncertainty and real options on the decision of working time and examine the determinants of employment and hours in a stochastic framework. A numbe...
متن کاملPath Planning under Time-Dependent Uncertainty
Standard algorithms for finding the short est path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis tic. We consider the problem of uncertain edge costs, with potential probabilistic de pendencies among the costs. Although these dependencies violate the standard dynamic programming decomposition, we identify a weaker stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatics
سال: 2020
ISSN: 2617-6963,1816-0301
DOI: 10.37661/1816-0301-2020-17-2-86-102