메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1331-1336

Dynamic Resource Allocation in Conservation Planning

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

EID: 84897530597     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (16)
  • 3
    • 77954961271 scopus 로고    scopus 로고
    • Technical report, ESRI
    • Environmental Systems Research Institute. 2008. ArcGIS 9.3 users manual. Technical report, ESRI.
    • (2008) ArcGIS 9.3 users manual
  • 4
    • 0010087219 scopus 로고    scopus 로고
    • Talk of the network: A complex systems look at the underlying process of word-of-mouth
    • Goldenberg, J.; Libai, B.; and Muller, E. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12(3):211-223.
    • (2001) Marketing Letters , vol.12 , Issue.3 , pp. 211-223
    • Goldenberg, J.1    Libai, B.2    Muller, E.3
  • 6
    • 77956526261 scopus 로고    scopus 로고
    • Budgeted nonparametric learning from data streams
    • Gomes, R., and Krause, A. 2010. Budgeted nonparametric learning from data streams. In ICML.
    • (2010) ICML
    • Gomes, R.1    Krause, A.2
  • 8
    • 0029753709 scopus 로고    scopus 로고
    • The quantitative incidence function model and persistence of an endangered butterfly metapopulation
    • Hanski, I. A.; Moilanen, A.; Pakkala, T.; and Kuussaari, M. 1996. The quantitative incidence function model and persistence of an endangered butterfly metapopulation. Conservation Biology 10.
    • (1996) Conservation Biology , vol.10
    • Hanski, I. A.1    Moilanen, A.2    Pakkala, T.3    Kuussaari, M.4
  • 12
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular set functions - I
    • Nemhauser, G. L.; Wolsey, L. A.; and Fisher, M. L. 1978. An analysis of approximations for maximizing submodular set functions - I. Math. Prog. 14(1):265-294.
    • (1978) Math. Prog , vol.14 , Issue.1 , pp. 265-294
    • Nemhauser, G. L.1    Wolsey, L. A.2    Fisher, M. L.3
  • 14
    • 85047019092 scopus 로고    scopus 로고
    • An online algorithm for maximizing submodular functions
    • Streeter, M., and Golovin, D. 2008. An online algorithm for maximizing submodular functions. In NIPS.
    • (2008) NIPS
    • Streeter, M.1    Golovin, D.2
  • 15
    • 0142029543 scopus 로고    scopus 로고
    • A note on maximizing a submodular set function subject to knapsack constraint
    • Sviridenko, M. 2004. A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters 32:41-43.
    • (2004) Operations Research Letters , vol.32 , pp. 41-43
    • Sviridenko, M.1


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