101 citations · 303 across the 42 of their papers we have counts for
Showing cs.NEShow all
3 papers · 1 filter
cs.NE2011★ 1 cited
Ant Colony Optimization and Hypergraph Covering Problems
Ankit Pat, Ashish Ranjan Hota
Ant Colony Optimization (ACO) is a very popular metaheuristic for solving computationally hard combinatorial optimization problems. Runtime analysis of ACO with respect to various…
cs.NE2011★ 46 cited
An Adaptive Quantum-inspired Differential Evolution Algorithm for 0-1 Knapsack Problem
Ashish Ranjan Hota, Ankit Pat
Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the…
cs.NE2010★ 1 cited
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
Sisir Koppaka, Ashish Ranjan Hota
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-i…