Mingyan Liu

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 Yi Gai

> Home > Persons > Mingyan Liu

Publications

2012
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/secon/GaiKL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/secon/GaiKL12
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
Online learning for combinatorial network optimization with restless Markovian rewards. SECON 2012: 28-36
2011
[c44]
- view
  authority control:
- export record
  dblp key:
  - conf/globecom/GaiKL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/globecom/GaiKL11
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards. GLOBECOM 2011: 1-6
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1109-1606
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1109-1606
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
Online Learning for Combinatorial Network Optimization with Restless Markovian Rewards. CoRR abs/1109.1606 (2011)
2010
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1012-3005
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1012-3005
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards. CoRR abs/1012.3005 (2010)

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.