Related papers: Exact cost minimization of a series-parallel syste…
This paper is concerned with the optimal number of redundant allocation to $n$-component coherent systems consist of heterogeneous dependent components. We assume that the system is built of $L$ groups of different components, $L\geq 1$,…
We study the allocation strategies for redundant components in the load-sharing series/parallel systems. We show that under the specified assumptions, the allocation of a redundant component to the stochastically weakest (strongest)…
Serial-parallel redundancy is a reliable way to ensure service and systems will be available in cloud computing. That method involves making copies of the same system or program, with only one remaining active. When an error occurs, the…
The dynamic algorithm to compute a Gr\"obner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first…
The series-parallel (active) redundancy allocation problem with mixed components (RAP) involves setting reliable objectives for components or subsystems to meet the resource consumption constraint, e.g., the total cost. RAP has been an…
Parametric linear programming is a central operation for polyhedral computations, as well as in certain control applications.Here we propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.This type…
Researchers and practitioners in the field of reliability engineering and optimization frequently use active redundancy techniques to intensify the performance of systems. In this article, we study allocation strategies of non-matching…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
Purpose: The model allocates the system components orders to the suppliers to minimize the parts price and the system construction delay penalties and maximize the system availability during its use. It considers the quantity-based discount…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
This paper proposes a signature-based approach for solving redundancy allocation problems when component lifetimes are not only heterogeneous but also dependent. The two common schemes for allocations, that is active and standby…
The main goal of distribution network (DN) expansion planning is essentially to achieve minimal investment constrained with specified reliability requirements. The reliability-constrained distribution network planning (RcDNP) problem can be…
As numerous machine learning and other algorithms increase in complexity and data requirements, distributed computing becomes necessary to satisfy the growing computational and storage demands, because it enables parallel execution of…
We provide a framework for the assignment of multiple robots to goal locations, when robot travel times are uncertain. Our premise is that time is the most valuable asset in the system. Hence, we make use of redundant robots to counter the…
In the context of industrial engineering, cold-standby redundancies allocation strategy is usually adopted to improve the reliability of coherent systems. This paper investigates optimal allocation strategies of cold standbys for series and…
Redundancy is related to the amount of functionality that the structure can sustain in the worst-case scenario of structural degradation. This paper proposes a widely-applicable concept of redundancy optimization of finite-dimensional…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
We study the consideration of fairness in redundant assignment for multi-agent task allocation. It has recently been shown that redundant assignment of agents to tasks provides robustness to uncertainty in task performance. However, the…