An implementation of maximum entropy sampling for spatial data is provided. An exact branch-and-bound algorithm as well as greedy and dual greedy heuristics are included.
|Author||Claudia Gebhardt [aut, cre], Robert Gentleman [ctb, cph] (covers file src/chol1.f and src/ch2inv1.f), Ross Ihaka [ctb, cph] (covers file src/chol1.f and src/ch2inv1.f), The University of Tennessee and The University of Tennessee Research Foundation [ctb, cph] (covers file src/dschur.f), The University of California Berkeley [ctb, cph] (covers file src/dschur.f), The University of Colorado Denver [ctb, cph] (covers file src/dschur.f)|
|Date of publication||2015-09-04 07:38:46|
|Maintainer||Claudia Gebhardt <firstname.lastname@example.org>|
|License||GPL (>= 2.0)|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.