Probabilistic-greedy-method-for-server-scheduling

Part of the greedy algorithm used to solve the 2018 Alibaba Tianchi Competition-Server Dispatch Competition. This method ranks 66 in the preliminary round and is ranked second in the semi-finals. It is a good starting method.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zangzelin%2FProbabilistic-greedy-method-for-server-scheduling

Stars: 6
Forks: 1
Open issues: 0

License: None
Language: Roff
Size: 13.4 MB
Dependencies parsed at: Pending

Created at: over 6 years ago
Updated at: about 2 years ago
Pushed at: over 6 years ago
Last synced at: about 1 year ago

Topics: algorithms, competition, method, np-hard, python3, tianchi

ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Repos

GitHub / zangzelin / Probabilistic-greedy-method-for-server-scheduling