Near-Optimal Incentive Allocation for Piggyback Crowdsensing
暂无分享,去创建一个
[1] Daqing Zhang,et al. iCrowd: Near-Optimal Task Allocation for Piggyback Crowdsensing , 2016, IEEE Transactions on Mobile Computing.
[2] Yu Zheng,et al. U-Air: when urban air quality inference meets big data , 2013, KDD.
[3] Valérie Issarny,et al. Probabilistic registration for large-scale mobile participatory sensing , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications (PerCom).
[4] Rishabh K. Iyer,et al. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.
[5] Andreas S. Schulz,et al. Revisiting the Greedy Approach to Submodular Set Function Maximization , 2007 .
[6] Hojung Cha,et al. Piggyback CrowdSensing (PCS): energy efficient crowdsourcing of mobile sensor data by exploiting smartphone app opportunities , 2013, SenSys '13.
[7] Fan Ye,et al. Mobile crowdsensing: current state and future challenges , 2011, IEEE Communications Magazine.
[8] Antonio Corradi,et al. Supporting Energy-Efficient Uploading Strategies for Continuous Sensing Applications on Mobile Phones , 2010, Pervasive.
[9] Deborah Estrin,et al. Recruitment Framework for Participatory Sensing Data Collections , 2010, Pervasive.
[10] Daqing Zhang,et al. CrowdRecruiter: selecting participants for piggyback crowdsensing under probabilistic coverage constraint , 2014, UbiComp.
[11] Daqing Zhang,et al. 4W1H in mobile crowd sensing , 2014, IEEE Communications Magazine.
[12] Jian Tang,et al. Energy-efficient collaborative sensing with mobile phones , 2012, 2012 Proceedings IEEE INFOCOM.
[13] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..