|
@@ -7,40 +7,12 @@
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
-void test() {
|
|
|
- /*ControlBandit cb;
|
|
|
- fillAndHeuristic fah;
|
|
|
- while(!cb.queueIsEmpty()) {
|
|
|
- fah = cb.next();
|
|
|
- printf("%d %d\n", fah.fill, fah.heuristic);
|
|
|
- }*/
|
|
|
-
|
|
|
- srand(getpid());
|
|
|
- double ref = 0;
|
|
|
- double avg = 0;
|
|
|
- int nb = 0;
|
|
|
-
|
|
|
- int rdm;
|
|
|
- for(int i = 0; i < 100; i++) {
|
|
|
- rdm = rand();
|
|
|
- avg = avg + (1 / (nb + 1.0)) * (rdm - avg);
|
|
|
- nb++;
|
|
|
- ref += rdm;
|
|
|
- }
|
|
|
- printf("ref : %f, ite : %f\n", ref/100.0, avg);
|
|
|
-
|
|
|
- exit(0);
|
|
|
-}
|
|
|
-
|
|
|
void help(char* prog) {
|
|
|
fprintf(stderr, "usage: %s -i file.cnf [-t int] [-s] [-e double]\n\t-t Number of threads to use\n\t-s Silent mode\n\t-e Use epsilon greedy method with the value (0 <= value <= 1)\n", prog);
|
|
|
exit(1);
|
|
|
}
|
|
|
|
|
|
int main(int argc, char* argv[]) {
|
|
|
-
|
|
|
- //test();
|
|
|
-
|
|
|
extern char * optarg;
|
|
|
int nbThread = DEFAULT_NB_THREAD;
|
|
|
bool verbose = true;
|