Date: 20170209
Hypotheses: H1: Addjoin is faster to converge than add and achieves the same results, H2: refine is better than replace (in [20170208-NOOR] for instance), H3: refadd is better than add and refine (especially with better recall)
Variation of: 20170208-NOOR
4 agents; 10 runs; 10000 games
Adaptation operators: refine addjoin refadd
Experimental setting: Exactly the same as [20170208-NOOR] with new operators
controled variables: ['revisionModality']
dependent variables: ['srate', 'size', 'inc', 'prec', 'fmeas', 'rec', 'conv']
Class used: NOOEnvironment, AlignmentAdjustingAgent, AlignmentRevisionExperiment, ActionLogger, AverageLogger, Monitor
Execution environment: Debian Linux virtual machine configured with four processors and 20GB of RAM running under a Dell PowerEdge T610 with 4*Intel Xeon Quad Core 1.9GHz E5-2420 processors, under Linux ProxMox 2 (Debian). - Java 1.8.0 HotSpot
For dealing with hypothesis H1, we compare with the result of add on 20170208-NOOR:
For dealing with hypothesis H2, we compare with the result of replace on 20170208-NOOR:
This file can be retrieved from URL https://sake.re/20170209-NOOR
It is possible to check out the repository by cloning https://felapton.inrialpes.fr/cakes/20170209-NOOR.git
This experiment has been transferred from its initial location at https://gforge.inria.fr (not available any more)
See original markdown (20170209-NOOR.md) or HTML (20170209-NOOR.html) files.