Slawomir T. Wierzchon

Graphical methods
for discrete dynamic programming problems

891

Abstract

In this paper the local computation method is used to sort decreasingly the space of total configurations with respect to the values of a function of many variables. A detailed description of the algorithm, including numerical examples is presented. The algorithm can be used in discrete optimization as well in Artificial Intelligence problems concerned with the evidence explanation in Bayesian networks.

Key words: Graphs, Hypergraphs, Local Computations, Discrete Optimization.