How do we program home robots to perform a wide variety of personalized everyday tasks?

We extend our results to the general case of maximizing a monotone submodular function subject to the intersection of a p-set system and multiple knapsack constraints. Finally, we evaluate the performance of our algorithms on multiple real-lifeapplications, includingmovierecommendation, locationsummarization, Twittertextsummarization,andvideosummarization.

The task is then to use a setS Dn of n 1 i.i.d.