메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Maximizing the contact opportunity for vehicular internet access

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE THROUGHPUT; BUDGET CONSTRAINT; DATA RATE SERVICES; DEPLOYMENT METHODS; DYNAMIC ELEMENTS; HANDHELDS; LARGE-SCALE WIRELESS LAN; MOBILE USERS; QUALITY OF DATA; REAL ROAD NETWORKS; SCALABLE INFRASTRUCTURE; SHORT TERM; VEHICULAR INTERNET ACCESS; WI FI NETWORKS; WI-FI SERVICE; WLAN ACCESS; WORST CASE;

EID: 77953312420     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5461937     Document Type: Conference Paper
Times cited : (75)

References (25)
  • 1
    • 19544382231 scopus 로고    scopus 로고
    • U.S. Census Bureau - TIGER/Line http://www.census.gov/geo/www/tiger/.
    • TIGER/Line
  • 3
    • 77953320435 scopus 로고    scopus 로고
    • Taking Wireless to the Max
    • businessweek.com/go/techmaven, Nov
    • Taking Wireless to the Max. Business Week (businessweek.com/go/techmaven) , pages 101-102, Nov. 2008.
    • (2008) Business Week , pp. 101-102
  • 17
    • 77951148076 scopus 로고
    • Accelerated Greedy Algorithms for Maximizing Submodular Set Functions
    • Optimization Techniques
    • Michel Minoux. Accelerated Greedy Algorithms for Maximizing Submodular Set Functions. Optimization Techniques, LNCS, 7:234-243, 1978.
    • (1978) LNCS , vol.7 , pp. 234-243
    • Minoux, M.1
  • 22
    • 77953318869 scopus 로고
    • Mutually repellant sampling
    • Ding-Zu Du and Panos M. Pardalos ed., Kluwer Academic Publishers
    • S.-H. Teng. Mutually repellant sampling. Minmax and its Applications, Ding-Zu Du and Panos M. Pardalos ed., Kluwer Academic Publishers, pages 129-140, 1995.
    • (1995) Minmax and Its Applications , pp. 129-140
    • Teng, S.-H.1
  • 23
    • 77953313488 scopus 로고    scopus 로고
    • FAQ
    • WiMax.com FAQ. http://www.wimax.com/education/faq/, 2008.
    • (2008)
  • 24
    • 51249182537 scopus 로고
    • An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem
    • L. A. Wolsey. An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem. Combinatorica, 2(4):385-393, 1982.
    • (1982) Combinatorica , vol.2 , Issue.4 , pp. 385-393
    • Wolsey, L.A.1


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