default search action
Vladislav Z. B. Tadic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j6]Vladislav Z. B. Tadic, Arnaud Doucet:
Bias of Particle Approximations to Optimal Filter Derivative. SIAM J. Control. Optim. 59(1): 727-748 (2021) - [j5]Vladislav Z. B. Tadic, Arnaud Doucet:
Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation. IEEE Trans. Inf. Theory 67(3): 1825-1848 (2021)
2010 – 2019
- 2019
- [j4]Vladislav Z. B. Tadic, Arnaud Doucet:
Analyticity of Entropy Rates of Continuous-State Hidden Markov Models. IEEE Trans. Inf. Theory 65(12): 7950-7975 (2019) - [c11]Vladislav Z. B. Tadic, Arnaud Doucet:
Stability of Optimal Filter Higher-Order Derivatives. CDC 2019: 1644-1649 - [c10]Vladislav Z. B. Tadic, Arnaud Doucet:
Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation. ISIT 2019: 887-891 - 2018
- [i1]Vladislav Z. B. Tadic, Arnaud Doucet:
Analyticity of Entropy Rates of Continuous-State Hidden Markov Models. CoRR abs/1806.09589 (2018) - 2011
- [c9]Vladislav Z. B. Tadic, Arnaud Doucet:
Asymptotic bias of stochastic gradient search. CDC/ECC 2011: 722-727 - 2010
- [j3]Arnaud Doucet, Adam M. Johansen, Vladislav Z. B. Tadic:
On solving integral equations using Markov chain Monte Carlo methods. Appl. Math. Comput. 216(10): 2869-2880 (2010)
2000 – 2009
- 2007
- [j2]Sumeetpal S. Singh, Vladislav Z. B. Tadic, Arnaud Doucet:
A policy gradient method for semi-Markov decision processes with application to call admission control. Eur. J. Oper. Res. 178(3): 808-818 (2007) - [c8]Vladislav Z. B. Tadic, Arnaud Doucet:
A Monte Carlo Algorithm for Optimal Quantization in Hidden Markov Models. ISIT 2007: 1121-1125 - 2005
- [c7]Christophe Andrieu, Arnaud Doucet, Vladislav Z. B. Tadic:
On-Line Parameter Estimation in General State-Space Models. CDC/ECC 2005: 332-337 - 2004
- [j1]Christophe Andrieu, Arnaud Doucet, Sumeetpal S. Singh, Vladislav Z. B. Tadic:
Particle methods for change detection, system identification, and control. Proc. IEEE 92(3): 423-438 (2004) - 2003
- [c6]Vladislav Z. B. Tadic, Arnaud Doucet, Sumeetpal S. Singh:
Two time-scale stochastic approximation for constrained stochastic optimization and constrained Markov decision problems. ACC 2003: 4736-4741 - [c5]Ba-Ngu Vo, Sumeetpal S. Singh, Vladislav Z. B. Tadic:
Adaptive envelope-constrained filtering. ICASSP (6) 2003: 345-348 - [c4]Bao Ling Chan, Arnaud Doucet, Vladislav Z. B. Tadic:
Optimisation of particle filters using simultaneous perturbation stochastic approximation. ICASSP (6) 2003: 681-684 - 2002
- [c3]Arnaud Doucet, Vladislav Z. B. Tadic:
On-line optimization of sequential Monte Carlo methods using stochastic approximation. ACC 2002: 2565-2570 - [c2]Vladislav Z. B. Tadic, Arnaud Doucet:
Exponential forgetting and geometric ergodicity in state-space models. CDC 2002: 2231-2235 - [c1]Sumetpal Singh, Vladislav Z. B. Tadic, Arnaud Doucet:
A policy gradient method for SMDPs with application to call admission control. ICARCV 2002: 1268-1274
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint