In this paper, we discuss dierent predictors of times to failure of units censored in multiple stages in a progressively censored  sample from proportional hazard rate models. The maximum likelihood predictors, best unbiased predictors and conditional median predictors are considered. We also consider Bayesian point predictors for the times to failure of units. A numerical example and a Monte C...

A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...

Therefore, an object can guarantee its survivability under circumstances where the objects cannot have a unique global view. Moreover, it introduces the notion of timing polymorphism that allows a server object to dynamically select one execution body (a method) that can be executed within the specied timing constraint. DROL is the rst step toward a programming language that incorporates the no...

With the increasing availability of multiprocessor platforms based on dierent types of archi-tectures (shared memory, distributed memory, network based), users will be increasingly faced with heterogeneous and distributed multiprocessor computing facilities. Programming environment concepts have to be found which enable the user to program and use these heterogeneous computing resources, consis...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

We present a Meta Constraint Logic Programming (MCLP) general scheme. The idea behind the work concerns the possibility of building meta CLP architectures by adding CLP solvers as meta level reasoners on the constraints of the underlying object systems. In this way, we are able not only to increase the expressive power of CLP, but also to implement several constraint satisfaction techniques lik...