Displaying 241 – 260 of 3895

Showing per page

A new efficient and flexible algorithm for the design of testable subsystems

Stéphane Ploix, Abed Alrahim Yassine, Jean-Marie Flaus (2010)

International Journal of Applied Mathematics and Computer Science

In complex industrial plants, there are usually many sensors and the modeling of plants leads to lots of mathematical relations. This paper presents a general method for finding all the possible testable subsystems, i.e., sets of relations that can lead to various types of detection tests. This method, which is based on structural analysis, provides the constraints that have to be used for the design of each detection test and manages situations where constraints contain non-deductible variables...

A new formulation for scheduling unrelated processor under precedence constraints

Nelson Maculan, Stella C.S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (2010)

RAIRO - Operations Research

We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.

Currently displaying 241 – 260 of 3895