Engineering Commons^™

Which Algorithms Are Feasible? Maxent Approach, Daniel E. Cooke, Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

It is well known that not all algorithms are feasible; whether an algorithm is feasible or not depends on how many computational steps this algorithm requires. The problem with the existing definitions of feasibility is that they are rather ad hoc. Our goal is to use the maximum entropy (MaxEnt) approach and get more motivated definitions.

If an algorithm is feasible, then, intuitively, we would expect the following to be true:

If we have a flow of problems with finite average length L, then we expect the average time T to be finite as well.

Thus, we can say …

Maximum Entropy Approach To Optimal Sensor Placement For Aerospace Non-Destructive Testing, Roberto A. Osegueda, Carlos M. Ferregut, Mary J. George, Jose M. Gutierrez, Vladik Kreinovich

Departmental Technical Reports (CS)

The ideal design of an airplane should include built-in sensors that are pre-blended in the perfect aerodynamic shape. Each built-in sensor is expensive to blend in and requires continuous maintenance and data processing, so we would like to use as few sensors as possible. The ideal formulation of the corresponding optimization problem is, e.g., to minimize the average detection error for fault locations. However, there are two obstacles to this ideal formulation:

--First, this ideal formulation requires that we know the probabilities of different fault locations and the probabilities of different aircraft exploitation regimes. In reality, especially for a …