Bogdan Alexandru Caprarescu

◀ ▷ joint publications with Dana Petcu

> Home > Persons > Bogdan Alexandru Caprarescu

Publications

2012
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/computing/CalcavecchiaCNDP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/CalcavecchiaCNDP12
Nicolò Maria Calcavecchia, Bogdan Alexandru Caprarescu, Elisabetta Di Nitto, Daniel J. Dubois, Dana Petcu:
DEPAS: a decentralized probabilistic algorithm for auto-scaling. Computing 94(8-10): 701-730 (2012)
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1202-2509
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1202-2509
Nicolò Maria Calcavecchia, Bogdan Alexandru Caprarescu, Elisabetta Di Nitto, Daniel J. Dubois, Dana Petcu:
DEPAS: A Decentralized Probabilistic Algorithm for Auto-Scaling. CoRR abs/1202.2509 (2012)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1202-2981
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1202-2981
Bogdan Alexandru Caprarescu, Eva Kaslik, Dana Petcu:
Theoretical Analysis and Tuning of Decentralized Probabilistic Auto-Scaling. CoRR abs/1202.2981 (2012)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1203-3885
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1203-3885
Bogdan Alexandru Caprarescu, Dana Petcu:
Decentralized Probabilistic Auto-Scaling for Heterogeneous Systems. CoRR abs/1203.3885 (2012)

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.