"Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest ..."

Aaron Kyle G. Butangen et al. (2020)

> Home

Details and statistics

DOI: 10.1145/3379247.3379296

access: closed

type: Conference or Workshop Paper

metadata version: 2021-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iccde/ButangenVCBB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccde/ButangenVCBB20
Aaron Kyle G. Butangen, Calvin E. Velasco, Jethro Czar B. Codmos, Eugene Frank G. Bayani, Rey Benjamin M. Baquirin:
Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm. ICCDE 2020: 14-18

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.