2017
DOI: 10.14257/ijseia.2017.11.4.01
|View full text |Cite
|
Sign up to set email alerts
|

A Methodology for Obtaining Complexity of Component-Based Software

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The average decision complexity is defined in (9). Perturbation resolving time metric is defined by combining the basic concepts of different research works [29]- [31], [33], [34]. PRT counts the number of average decisions made inside each of the p numbers of managers involved in an SMC, and adds the number of interactions originating from each of the p managers and q resources involved in the SMC.…”
Section: Decision Complexity = Max(nd Path I ) For I=1 To Np Rs (8)mentioning
confidence: 99%
“…The average decision complexity is defined in (9). Perturbation resolving time metric is defined by combining the basic concepts of different research works [29]- [31], [33], [34]. PRT counts the number of average decisions made inside each of the p numbers of managers involved in an SMC, and adds the number of interactions originating from each of the p managers and q resources involved in the SMC.…”
Section: Decision Complexity = Max(nd Path I ) For I=1 To Np Rs (8)mentioning
confidence: 99%