A methodology for e-Readiness Computation using Divide, Predict and Conquer Approach

Authors

  • Gajendra Sharma Department of Computer Science and Engineering, Kathmandu University
  • Deep Raj Sharma Department of Computer Science and Engineering, Kathmandu University

DOI:

https://doi.org/10.3126/jie.v12i1.16888

Keywords:

e-Readiness, Divide Predict and Conquer, Linear Regression, Clustering

Abstract

There exist some problems which seem partially similar to Divide and Conquer approach but can’t be solved using this approach. Such type of problems can be divisible into sub problems of different size but the same mechanism may not be useful to solve all of the sub problems. While using the same mechanism to solve all of the sub problems they can be classified into two kinds, first having a solution, second having no solution. The proposed approach in this paper analyses the features of sub-problems that can be solved and finds a solution for the unsolvable problems using those features. Further, we advocate this method is suitable for computation of e-Readiness in developing countries like Nepal, who are bounded to invest a very low budget in Technological Researches.

Journal of the Institute of Engineering, 2016, 12(1): 143-150 

Downloads

Download data is not yet available.
Abstract
2179
PDF
1388

Downloads

Published

2017-03-06

How to Cite

Sharma, G., & Sharma, D. R. (2017). A methodology for e-Readiness Computation using Divide, Predict and Conquer Approach. Journal of the Institute of Engineering, 12(1), 143–150. https://doi.org/10.3126/jie.v12i1.16888

Issue

Section

Articles