2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.NE2020★ 2 cited
Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem
Ivars Dzalbs, Tatiana Kalganova, Ian Dear
The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications. In order to solve this NP-hard problem, a new…
cs.NE2020
Dynamic Impact for Ant Colony Optimization algorithm
Jonas Skackauskas, Tatiana Kalganova, Ian Dear +1
This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact. Dynamic Impact is designed to solve challenging optimization problems tha…
cs.CV2020
No Routing Needed Between Capsules
Adam Byerly, Tatiana Kalganova, Ian Dear
Most capsule network designs rely on traditional matrix multiplication between capsule layers and computationally expensive routing mechanisms to deal with the capsule dimensional…