Jonatha Anselmi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with François Dufour

> Home > Persons > Jonatha Anselmi

Publications

2020
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/AnselmiD20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/AnselmiD20
Jonatha Anselmi, François Dufour:
Power-of-d-Choices with Memory: Fluid Limit and Optimality. Math. Oper. Res. 45(3): 862-888 (2020)
2018
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/jap/AnselmiDP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jap/AnselmiDP18
Jonatha Anselmi, François Dufour, Tomás Prieto-Rumeau:
Computable approximations for average Markov decision processes in continuous time. J. Appl. Probab. 55(2): 571-592 (2018)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1802-06566
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1802-06566
Jonatha Anselmi, François Dufour:
Power-of-d-Choices with Memory: Fluid Limit and Optimality. CoRR abs/1802.06566 (2018)
2017
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/fusion/ZhangDALN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fusion/ZhangDALN17
Huilong Zhang, François Dufour, Jonatha Anselmi, Dann Laneuville, Adrien Negre:
Piecewise optimal trajectories of observer for bearings-only tracking by quantization. FUSION 2017: 1-7

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.