This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance P

Build a decision tree (DT) classfier using the following three strategies for stopping growth of a tree: i) threshold on the decrease in impurity ii) threshold on the number of data vectors at a node iii) grow the tree as much as possible and the