On an algorithm that generates an interesting maximal set P(n) of the naturals for any n greater than or equal to 2
Bidu Prakash DasSoubhik ChakrabortyPublished in: CoRR (2008)
Keyphrases
- detection algorithm
- preprocessing
- lower and upper bounds
- theoretical analysis
- experimental evaluation
- computational cost
- objective function
- recognition algorithm
- optimization algorithm
- input data
- solution space
- high accuracy
- cost function
- search space
- initial set
- improved algorithm
- significant improvement
- particle swarm optimization
- convex hull
- minimal length
- times faster
- convergence rate
- scoring function
- input pattern
- data sets
- path planning
- classification algorithm
- segmentation algorithm
- linear programming
- simulated annealing
- knn
- probabilistic model
- computational complexity
- optimal solution
- decision trees
- learning algorithm