메뉴 건너뛰기




Volumn , Issue , 2010, Pages 39-44

The case for crowd computing

Author keywords

distributed computation; human mobility; task farming

Indexed keywords


EID: 78149337560     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1851322.1851334     Document Type: Conference Paper
Times cited : (86)

References (25)
  • 1
    • 78149319304 scopus 로고    scopus 로고
    • Amazon Mechanical Turk. http://www.mturk.com/.
  • 2
    • 78149298073 scopus 로고    scopus 로고
    • CRAWDAD. http://crawdad.cs.dartmouth.edu/.
  • 3
    • 78149318553 scopus 로고    scopus 로고
    • Folding@home PS3 FAQ
    • Folding@home PS3 FAQ. http://folding.stanford.edu/English/FAQ-PS3.
  • 4
    • 78149321160 scopus 로고    scopus 로고
    • Haggle. http://www.haggleproject.org/.
  • 7
    • 62949172850 scopus 로고    scopus 로고
    • Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs
    • E. M. Daly and M. Haahr. Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. In Proceedings of MobiHoc, 2007.
    • Proceedings of MobiHoc, 2007
    • Daly, E.M.1    Haahr, M.2
  • 9
    • 33645311516 scopus 로고    scopus 로고
    • Reality mining: Sensing complex social systems
    • May
    • N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, V10(4):255-268, May 2006.
    • (2006) Personal and Ubiquitous Computing , vol.10 , Issue.4 , pp. 255-268
    • Eagle, N.1    Pentland, A.2
  • 10
    • 0036670170 scopus 로고    scopus 로고
    • Mobility increases the capacity of ad hoc wireless networks
    • DOI 10.1109/TNET.2002.801403, PII 1011092002801403
    • M. Grossglauser and D. N. C. Tse. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw., 10(4):477-486, 2002. (Pubitemid 35000391)
    • (2002) IEEE/ACM Transactions on Networking , vol.10 , Issue.4 , pp. 477-486
    • Grossglauser, M.1    Tse, D.N.C.2
  • 14
    • 34347251103 scopus 로고    scopus 로고
    • Probabilistic Routing in Intermittently Connected Networks
    • A. Lindgren, A. Doria, and O. Schelén. Probabilistic Routing in Intermittently Connected Networks. LNCS, 3126:239-254, 2004.
    • (2004) LNCS , vol.3126 , pp. 239-254
    • Lindgren, A.1    Doria, A.2    Schelén, O.3
  • 18
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • Feb
    • M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, Feb 2004.
    • (2004) Phys. Rev. E , vol.69 , Issue.2 , pp. 026113
    • Newman, M.E.J.1    Girvan, M.2
  • 19
    • 33947176178 scopus 로고    scopus 로고
    • Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks
    • DOI 10.1109/MCOM.2006.248176
    • L. Pelusi, A. Passarella, and M. Conti. Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine, 44(11):134-141, 2006. (Pubitemid 46405650)
    • (2006) IEEE Communications Magazine , vol.44 , Issue.11 , pp. 134-141
    • Pelusi, L.1    Passarella, A.2    Conti, M.3
  • 24
    • 78149286327 scopus 로고    scopus 로고
    • Visualizing communities and centralities from encounter traces
    • E. Yoneki. Visualizing communities and centralities from encounter traces. In Proceedings of CHANTS, 2008.
    • Proceedings of CHANTS, 2008
    • Yoneki, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.