On the forecasting abilities of a time varying autoadapting algorithm.
Antonio BallarinSimona GervasiStefano BacchettiUmberto CapponiStefano CostiKristian A. Gervasi VidalPaul B. MooreCarlo NardoneGiovanni PassaliFrancesco SagoneMorena SignoriFabrizio VolleraPublished in: Neural Parallel Sci. Comput. (2010)
Keyphrases
- np hard
- cost function
- experimental study
- experimental evaluation
- worst case
- objective function
- times faster
- preprocessing
- computational cost
- detection algorithm
- optimization algorithm
- computationally efficient
- similarity measure
- particle swarm optimization
- selection algorithm
- theoretical analysis
- high accuracy
- dynamic programming
- computational complexity
- optimal solution
- linear programming
- simulated annealing
- scheduling problem
- ant colony optimization
- mathematical model
- tree structure
- matching algorithm
- convergence rate
- recognition algorithm
- improved algorithm