๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The computational complexity of some fuzzy dynamic programs

โœ Scribed by A.O. Esogbue

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
292 KB
Volume
37
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

Fuzzy dynamic programming, a natural extension of classical dynamic programming, is of great appeal in the modeling and control of certain systems, especially those of a socio-technical systems nature. However, data acquisition, manipulation, and processing create immense problems to the systems designer interested in such realistic modeling tools. Another complication is introduced in the numerical implementation of these models. The usual dimensionality issues characteristic of conventional dynamic programming must be addressed in their fuzzy analogues. We do so for these problems via two variations of a fuzzy dynamic programming model of decision making in a fuzzy environment first proposed by Kacprzyk and then modified by Stein. We consider in particular, both time and space complexity problems associated with the model. (~

๐Ÿ“œ SIMILAR VOLUMES

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
โœ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=