| ;;;; Gmap rules ;;; Support from its MH's. At this time we ignore other expressionors such as number of candidate inferences |
....time behavior. 3.3.6 Analysis of Step # 6: SES computation The complexity of the BMS is difficult to ascertain. Fortunately, it is irrelevant to our analysis since the BMS can be eliminated if detailed justifications of evidential results are not required. For example, the first version of SME [20] used specialized evidence rules which had most of the flexibility of the BMS based rules yet ran in O (M) time. Although the flexibility of the BMS can be valuable, in fact the majority of SME s processing time takes place within it typically 70 to 80 . So far this has not been a serious ....
;;;; Gmap rules ;;; Support from its MH's. At this time we ignore other expressionors such as number of candidate inferences
....time behavior. 3.3.6 Analysis of Step # 6: SES computation The complexity of the BMS is difficult to ascertain. Fortunately, it is irrelevant to our analysis since the BMS can be eliminated if detailed justifications of evidential results are not required. For example, the first version of SME [20] used specialized evidence rules which had most of the flexibility of the BMS based rules yet ran in O (M) time. Although the flexibility of the BMS can be valuable, in fact the majority of SME s processing time takes place within it typically 70 to 80 . So far this has not been a serious ....
;;;; Gmap rules ;; Support from its MH's. At this time we ignore other expressionors such as number ;; of candidate inferences, etc.
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