Judy Goldsmith and Robert H. Sloan. The complexity of model aggregation. In Proceedings AIPS-2000, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Markov Indecision Processes: A Formal Model of Decision-Making.. - Bovik, al. (2003) Self-citation (Goldsmith) (Correct)
No context found.
Judy Goldsmith and Robert H. Sloan. The complexity of model aggregation. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems (AIPS), pages 122--129, 2000.
Markov Indecision Processes: A Formal Model of.. - Bovik, Goldsmith.. Self-citation (Goldsmith) (Correct)
....cases, these are identi ed with the confusion state i C . However, in the stable state case, there may be a signi cant reduction in the number of meta states considered. Unfortunately, determining the stability of partitions of MESSs has been shown to be hard for the complexity class NP PP #P (Goldsmith Sloan, 2000; U. S. Bureau of the Census, 1998) and thus this approach is deemed infeasible by those who cannot fease probabilistic relativized oracles. The model presented here is highly non linear. Future work could include an extension to the tree structured hierarchy of redundant indecision hierarchies. ....
Goldsmith, J., & Sloan, R. H. (2000). The complexity of model aggregation. Proceedings of the Fifth International Conference on Articial Intelligence Planning Systems (AIPS) (pp. 122-129).
Solving Factored MDPs via Non-Homogeneous Partitioning - Kee-Eung Kim And (Correct)
No context found.
Judy Goldsmith and Robert H. Sloan. The complexity of model aggregation. In Proceedings AIPS-2000, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC