42 citations · 53 across the 8 of their papers we have counts for
4 papers · 1 filter
Hebbian Graph Embeddings
Shalin Shah, Venkataramana Kini
Representation learning has recently been successfully used to create vector representations of entities in language learning, recommender systems and in similarity learning. Graph…
Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem
Shalin Shah
The 0/1 multidimensional knapsack problem is the 0/1 knapsack problem with m constraints which makes it difficult to solve using traditional methods like dynamic programming or bra…
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking
Jianfeng Gao, Qiang Wu, Chris Burges +5
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The resu…
Genetic Algorithm for a class of Knapsack Problems
Shalin Shah
The 0/1 knapsack problem is weakly NP-hard in that there exist pseudo-polynomial time algorithms based on dynamic programming that can solve it exactly. There are also the core bra…