Raul A. Trejo, Ph.D.
Affiliations: | 2001 | University of Texas at El Paso, El Paso, TX, United States |
Area:
Computer Science, Artificial IntelligenceGoogle:
"Raul Trejo"Parents
Sign in to add mentorVladik Kreinovich | grad student | 2001 | UT El Paso | |
(Interval computation methods and probabilistic methods for planning and plan checking under uncertainty and incomplete information.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Trejo R, Kreinovich V. (2002) Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems International Journal of General Systems. 31: 17-27 |
Trejo R, Kreinovich V, Goodman IR, et al. (2002) A realistic (non-associative) logic and a possible explanations of 7 ± 2 law International Journal of Approximate Reasoning. 29: 235-266 |
Trejo R, Galloway J, Sachar C, et al. (2001) From planning to searching for the shortest plan: An optimal transition International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems. 9: 827-837 |
Baral C, Kreinovich V, Trejo RA. (2001) Computational complexity of planning with temporal goals Ijcai International Joint Conference On Artificial Intelligence. 509-514 |
Baral C, Tuan LC, Trejo R, et al. (2000) Computational complexity of planning based on partial information about the system's present and past states Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1861: 882-896 |
Baral C, Kreinovich V, Trejo R. (1999) Computational complexity of planning and approximate planning in presence of incompleteness Ijcai International Joint Conference On Artificial Intelligence. 2: 948-953 |
Lea RN, Kreinovich V, Trejo R. (1996) Optimal interval enclosures for fractionally-linear functions, and their application to intelligent control Reliable Computing. 2: 265-285 |