The use of knapsack 0/1 in prioritizing software requirements and Markov chain to predict software success
dc.contributor.author | Armah, Isaac Aduhene | |
dc.contributor.author | Hayfron‑Acquah, James Ben | |
dc.contributor.author | Takyi, Kate | |
dc.contributor.author | Gyening, Rose‑Mary Owusuaa Mensah | |
dc.contributor.author | Eshun, Michael | |
dc.contributor.orcid | 0000-0002-8087-5207 | |
dc.date.accessioned | 2024-11-14T10:13:09Z | |
dc.date.available | 2024-11-14T10:13:09Z | |
dc.date.issued | 2023-09 | |
dc.description | This article is published by Springer, 2023 and is also available at https://doi.org/10.1007/s41870-023-01476-4 | |
dc.description.abstract | Requirements prioritization is one of the most valuable aspects of software engineering. This is primarily due to the fact that resources, be it time, skillset, or budget, are limited. Existing complex methodologies, such as ana lytical heuristic process (AHP) and planning game, face low adoption in the industry, promoting the need for more accessible techniques. This research introduces a novel con tribution to software engineering by ofering a simple and scalable approach to requirement prioritization (RP) and software acceptance prediction. The proposed approach con sists of two key methods, knapsack 0/1 and Markov, to opti mize RP and predict software acceptance respectively. By considering constraints, organizations can make enlightened decisions on handling requirements and optimize their mini mum viable product. The results showcase signifcant time efciency, with an average worst-case time of 5.645s for 10,000 requirements and an upper bound of 0.023s for the Markov prediction. This study aims to provide practitioners with a practical solution for prioritizing requirements and predicting software outcomes from user acceptance tests. By simplifying the process and ofering compelling time complexity, this approach contributes to the enhancement of software development practices. | |
dc.description.sponsorship | KNUST | |
dc.identifier.citation | Int. j. inf. tecnol. (March 2024) 16(3):1967–1979 | |
dc.identifier.uri | 10.1007/s41870-023-01476-4 | |
dc.identifier.uri | https://ir.knust.edu.gh/handle/123456789/15943 | |
dc.language.iso | en | |
dc.publisher | Springer | |
dc.title | The use of knapsack 0/1 in prioritizing software requirements and Markov chain to predict software success | |
dc.type | Article |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- The use of knapsack 01 in prioritizing software requirements.pdf
- Size:
- 1.02 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: