Learning algorithms, as NN or C4.5 require adequate sets of examples. In the paper we present the usability of genetic algorithms for selection significant features. Fitness of ind...
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...
C. Paul Bonnington, R. Bruce Richter, Mark E. Watk...