Search Results for author:
Found 3 papers, 1 papers with code
Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem
The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications.
Dynamic Impact for Ant Colony Optimization algorithm
This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact.
No Routing Needed Between Capsules
Most capsule network designs rely on traditional matrix multiplication between capsule layers and computationally expensive routing mechanisms to deal with the capsule dimensional entanglement that the matrix multiplication introduces.
Ranked #1 on
Image Classification
on MNIST
