Arc graphs and their possible application to sparse matrix problems
β Scribed by Werner C. Rheinboldt; Charles K. Mesztenyi
- Publisher
- Springer Netherlands
- Year
- 1974
- Tongue
- English
- Weight
- 752 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345. We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on A
We discuss the State ReductionΓGTH (Grassmann, Taksar, Heyman) algorithm for recursively finding invariant measure. We demonstrate the relationship between this algorithm and the Freidlin Wentzell ``tree decomposition'' approach to study the characteristics of Markov chains. The structure of the Sta