Advanced search
2 files | 1.08 MB

Using the Ornstein-Uhlenbeck process for random exploration

Johannes Nauta (UGent) , Yara Khaluf (UGent) and Pieter Simoens (UGent)
Author
Organization

Downloads

  • 7449 i.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 344.31 KB
  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 740.33 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Nauta, Johannes, Yara Khaluf, and Pieter Simoens. 2019. “Using the Ornstein-Uhlenbeck Process for Random Exploration.” In Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2019), 59–66. SCITEPRESS .
APA
Nauta, J., Khaluf, Y., & Simoens, P. (2019). Using the Ornstein-Uhlenbeck process for random exploration. Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2019) (pp. 59–66). Presented at the 4th International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS2019), SCITEPRESS .
Vancouver
1.
Nauta J, Khaluf Y, Simoens P. Using the Ornstein-Uhlenbeck process for random exploration. Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2019). SCITEPRESS ; 2019. p. 59–66.
MLA
Nauta, Johannes, Yara Khaluf, and Pieter Simoens. “Using the Ornstein-Uhlenbeck Process for Random Exploration.” Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2019). SCITEPRESS , 2019. 59–66. Print.
@inproceedings{8616757,
  author       = {Nauta, Johannes and Khaluf, Yara and Simoens, Pieter},
  booktitle    = {Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2019)},
  isbn         = {9789897583667},
  language     = {eng},
  location     = {Heraklion, Greece},
  pages        = {59--66},
  publisher    = {SCITEPRESS },
  title        = {Using the Ornstein-Uhlenbeck process for random exploration},
  year         = {2019},
}