Historical prioritisation and reprioritisations using hierarchical historical R-tree
by Varun Gupta; Durg Singh Chauhan; Kamlesh Dutta
International Journal of Computer Applications in Technology (IJCAT), Vol. 54, No. 4, 2016

Abstract: Mass market software development involves uncertainties and involves effortful activities of requirement prioritisation and reprioritisations that may lead to delivery cost and time overrun. To facilitate the minimisation of efforts in resource constrained incremental developments, the historical preferences of stakeholders of previous similar projects could be reused during the development of the new similar project by employing the modified version of the HR tree, indexing structure as used for historical indexing of moving objects, for performing prioritisation and reprioritisations of the similar context project. The proposed data structure, i.e., HHR tree is capable of handling both requirements and decision aspects for performing prioritisations and reprioritisations by reusing historical preference values.

Online publication date: Sat, 26-Nov-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com