<p>The average escape time is the average time of three runs in each of the three obstacle configurations.</p
<p>Average running time (in seconds) over 10 runs by three community detection algorithms.</p
<p>The average number of trials and average error rate (when applicable) for each analysis.</p
<p>The average time until one of the population wins in the one-dimensional system, with .</p
<p>As a baseline, when there is no obstacle in the room, the average escape speed of the crowd deter...
<p>Panels a, b and c are for zero obstacle, one obstacle and two obstacles, respectively. The data o...
<p>The average escape speed for zero, one and two obstacles with the optimized positions is shown fo...
<p>Average time (mean±S.E.) to reach the goal container in successive trials of the spatial learning...
<p>The average time until one of the population wins in the striped , and system, with .</p
<p>A: Average allotted time over the subjects in three rounds of two trials. B: Average total perfor...
The comparison of the average running time of the examined methods for 150 experiments executed for ...
<p>Comparative analysis of the optimal departure time between two different schemes.</p
<p>(a) Reaction times grouped by trial difficulty and type. (b) Each subject's mean reaction times a...
<p>The most efficient settings are at the side of the door but not in front of the door and the tang...
<p>Average escape time (in sec) against trial number <i>N</i> obtained from: (a) Individual training...
<p>(A) Escape variants often only transiently replace the wild-type variant and oscillate thereafter...
<p>Average running time (in seconds) over 10 runs by three community detection algorithms.</p
<p>The average number of trials and average error rate (when applicable) for each analysis.</p
<p>The average time until one of the population wins in the one-dimensional system, with .</p
<p>As a baseline, when there is no obstacle in the room, the average escape speed of the crowd deter...
<p>Panels a, b and c are for zero obstacle, one obstacle and two obstacles, respectively. The data o...
<p>The average escape speed for zero, one and two obstacles with the optimized positions is shown fo...
<p>Average time (mean±S.E.) to reach the goal container in successive trials of the spatial learning...
<p>The average time until one of the population wins in the striped , and system, with .</p
<p>A: Average allotted time over the subjects in three rounds of two trials. B: Average total perfor...
The comparison of the average running time of the examined methods for 150 experiments executed for ...
<p>Comparative analysis of the optimal departure time between two different schemes.</p
<p>(a) Reaction times grouped by trial difficulty and type. (b) Each subject's mean reaction times a...
<p>The most efficient settings are at the side of the door but not in front of the door and the tang...
<p>Average escape time (in sec) against trial number <i>N</i> obtained from: (a) Individual training...
<p>(A) Escape variants often only transiently replace the wild-type variant and oscillate thereafter...
<p>Average running time (in seconds) over 10 runs by three community detection algorithms.</p
<p>The average number of trials and average error rate (when applicable) for each analysis.</p
<p>The average time until one of the population wins in the one-dimensional system, with .</p
DOI
Add to ORKG