Danil V. Prokhorov

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 Zhen Ni

> Home > Persons > Danil V. Prokhorov

Publications

2015
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/tnn/NiHZXP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tnn/NiHZXP15
Zhen Ni, Haibo He, Dongbin Zhao, Xin Xu, Danil V. Prokhorov:
GrDHP: A General Utility Function Representation for Dual Heuristic Dynamic Programming. IEEE Trans. Neural Networks Learn. Syst. 26(3): 614-627 (2015)
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/tnn/NiHZP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tnn/NiHZP15
Zhen Ni, Haibo He, Xiangnan Zhong, Danil V. Prokhorov:
Model-Free Dual Heuristic Dynamic Programming. IEEE Trans. Neural Networks Learn. Syst. 26(8): 1834-1839 (2015)
2012
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/ijcnn/NiHZP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcnn/NiHZP12
Zhen Ni, Haibo He, Dongbin Zhao, Danil V. Prokhorov:
Reinforcement learning control based on multi-goal representation using hierarchical heuristic dynamic programming. IJCNN 2012: 1-8
2011
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/ijcnn/NiHPF11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcnn/NiHPF11
Zhen Ni, Haibo He, Danil V. Prokhorov, Jian Fu:
An online actor-critic learning approach with Levenberg-Marquardt algorithm. IJCNN 2011: 2333-2340

a service of

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.