LSVMK Langrangian Support Vector Machine algorithm
LSVMK solves a support vector machine problem using an iterative
algorithm inspired by an augmented Lagrangian formulation.
遺傳算法和“貨郎擔” 問題:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
aiNet application is a very powerful and a very simple tool for solving the problems which are usually solved with artificial neural networks (ANN). All possible tests we had run proved that the results obtained with aiNet are at least as good as the results obtained with some other ANNs. Let us state some of aiNet抯 features.
(c) aiNet 1995-1997
