Jichuan Yang

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 Harold J. Kushner

> Home > Persons > Jichuan Yang

Publications

1995
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/questa/KushnerYJ95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/questa/KushnerYJ95
Harold J. Kushner, Jichuan Yang, Dennis Jarvis:
Controlled and optimally controlled multiplexing systems: A numerical exploration. Queueing Syst. Theory Appl. 20(3-4): 255-291 (1995)
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tac/KushnerY95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tac/KushnerY95
Harold J. Kushner, Jichuan Yang:
Stochastic approximation with averaging and feedback: rapidly convergent "on-line" algorithms. IEEE Trans. Autom. Control. 40(1): 24-34 (1995)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tac/KushnerY95a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tac/KushnerY95a
Harold J. Kushner, Jichuan Yang:
Analysis of adaptive step-size SA algorithms for parameter tracking. IEEE Trans. Autom. Control. 40(8): 1403-1410 (1995)
1994
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/informs/KushnerY94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/KushnerY94
Harold J. Kushner, Jichuan Yang:
A Numerical Method for Controlled Routing in Large Trunk Line Networks via Stochastic Control Theory. INFORMS J. Comput. 6(3): 300-316 (1994)

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.