27 citations · 40 across the 13 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2022★ 1 cited
On the Complexity of Bayesian Generalization
Yu-Zhe Shi, Manjie Xu, John E. Hopcroft +6
We consider concept generalization at a large scale in the diverse and natural visual spectrum. Established computational modes (i.e., rule-based or similarity-based) are primarily…
cs.AI2020★ 2 cited
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
Liwen Li, Zequn Wei, Jin-Kao Hao +1
Knapsack problems are classic models that can formulate a wide range of applications. In this work, we deal with the Budgeted Maximum Coverage Problem (BMCP), which is a generalize…
cs.AI2020
Adaptive Large Neighborhood Search for Circle Bin Packing Problem
Kun He, Kevin Tole, Fei Ni +2
We address a new variant of packing problem called the circle bin packing problem (CBPP), which is to find a dense packing of circle items to multiple square bins so as to minimize…