We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
This paper presents a novel stochastic optimization approach to solve constrained economic load dispatch (ELD) problem using Hybrid Bacterial Foraging-Differential Evolution optimi...
Arijit Biswas, Sambarta Dasgupta, Bijaya K. Panigr...
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...