In this paper a redundancy allocation problem is studied where for the first time the supplier selection is taken into consideration and redundant components are provided from appropriate suppliers with the most suitable offers such as discount on buying price of components, warranty length for components, things like that, so that the system reliability, profit and the warranty length proposed...

We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourceforge.net), a freely available source code, and therefore can be reproduced. The goal is an independent comparison of learning methods in the framework of SDP. 1 What is stochastic dynamic programming (SDP) ? We here very roughl...

For hostile communication environments, noncentralized mobile communication network with directive/adaptive antennas and Global Positioning System (GPS) has been proposed for the purpose of minimizing the radio exposure and making it difficult for an interceptor to detect the signals. This paper investigates the interceptor’s search for the direction-of-arrival (DOA) of the transmitting signal ...

The purpose of this paper is to propose a solution methodology for a missile defense problem involving the sequential allocation of defensive resources over a series of engagements. The problem is cast as a dynamic programming/Markovian decision problem, which is computationally intractable by exact methods because of its large number of states and its complex modeling issues. We have employed ...

This paper discusses the determination of an optimal maintenance policy for a repairable system exhibiting a linearly increasing hazard rate, a constant repair rate and a predetermined availability. Under the preventive maintenance policy, the system availability is guaranteed and the time interval between preventive maintenance actions incurring minimal cost is analysed and presented.

The whole computer hardware industry embraced the multi-core. The extreme optimisation of sequential algorithms is then no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism. Decision tree algorithms exhibit natural concurrency that makes them suitable to be parallelised. This paper presents an in-depth study of the parallelisation of a...

Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...

Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...

In this study, we solve a class of multiple testing problems under Bayesian sequential decision framework. Our work is motivated by binary labeling tasks in crowdsourcing, where requestor needs to simultaneously choose worker provide label and decide when stop collecting labels, certain budget constraint. We begin using hypothesis problem determine the true single object, an optimal solution ca...

For repairable items sold with free replacement warranty, the actions available to the manufacturer to rectify failures under warranty are to (1) repair the failed item or (2) replace it with a new one. A proper repair-replace strategy can reduce the expected cost of servicing the warranty. In this paper, we study repair-replace strategies for items sold with a two-dimensional free replacement ...