best_val          564 ompi/mca/topo/treematch/treematch/tm_tree.c int recurs_select_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection)
best_val          575 ompi/mca/topo/treematch/treematch/tm_tree.c     if( val < *best_val ){
best_val          576 ompi/mca/topo/treematch/treematch/tm_tree.c       *best_val = val;
best_val          591 ompi/mca/topo/treematch/treematch/tm_tree.c       return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection);
best_val          600 ompi/mca/topo/treematch/treematch/tm_tree.c int test_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection)
best_val          615 ompi/mca/topo/treematch/treematch/tm_tree.c       return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection);
best_val          682 ompi/mca/topo/treematch/treematch/tm_tree.c int  select_independent_groups(group_list_t **tab_group, int n, int arity, int M, double *best_val,
best_val          707 ompi/mca/topo/treematch/treematch/tm_tree.c     recurs_select_independent_groups(tab_group, i+1, n, arity, 1, M, val, best_val, selection, best_selection);
best_val          721 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, M, arity, *best_val);
best_val          778 ompi/mca/topo/treematch/treematch/tm_tree.c 				      double val, double *best_val, group_list_t **selection, group_list_t **best_selection,
best_val          792 ompi/mca/topo/treematch/treematch/tm_tree.c     if( val < *best_val ){
best_val          796 ompi/mca/topo/treematch/treematch/tm_tree.c       *best_val = val;
best_val          819 ompi/mca/topo/treematch/treematch/tm_tree.c     if(val+elem->val < *best_val){
best_val          820 ompi/mca/topo/treematch/treematch/tm_tree.c       if(val+elem->bound[nb_groups_to_find]>*best_val){
best_val          934 ompi/mca/topo/treematch/treematch/tm_tree.c   double *best_val= (double *) args[4];
best_val          999 ompi/mca/topo/treematch/treematch/tm_tree.c       thread_derecurs_exhaustive_search(tab_group, id+1, n, arity, work->nb_groups, solution_size, val, best_val, selection, best_selection, indep_mat, lock, thread_id, tab_i, work->nb_groups);
best_val         1124 ompi/mca/topo/treematch/treematch/tm_tree.c static int thread_exhaustive_search(group_list_t **tab_group, int nb_groups, int arity, int solution_size, double *best_val,
best_val         1184 ompi/mca/topo/treematch/treematch/tm_tree.c     args[4]=(void*)best_val;
best_val         1220 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
best_val         1230 ompi/mca/topo/treematch/treematch/tm_tree.c static int old_recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat)
best_val         1239 ompi/mca/topo/treematch/treematch/tm_tree.c     if( val < *best_val ){
best_val         1240 ompi/mca/topo/treematch/treematch/tm_tree.c       *best_val = val;
best_val         1254 ompi/mca/topo/treematch/treematch/tm_tree.c     if(val+elem->val<*best_val){
best_val         1260 ompi/mca/topo/treematch/treematch/tm_tree.c 	old_recurs_exhaustive_search(tab, i+1, n, arity, d+1, solution_size, val, best_val, selection, best_selection, indep_mat);
best_val         1272 ompi/mca/topo/treematch/treematch/tm_tree.c static int recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat, int* tab_i)
best_val         1280 ompi/mca/topo/treematch/treematch/tm_tree.c     if( val < *best_val ){
best_val         1281 ompi/mca/topo/treematch/treematch/tm_tree.c       *best_val = val;
best_val         1298 ompi/mca/topo/treematch/treematch/tm_tree.c     if(val+elem->val<*best_val){
best_val         1325 ompi/mca/topo/treematch/treematch/tm_tree.c static int  exhaustive_search(group_list_t **tab_group, int n, int arity, int solution_size, double *best_val,
best_val         1362 ompi/mca/topo/treematch/treematch/tm_tree.c     old_recurs_exhaustive_search(tab_group, i+1, n, arity, 1, solution_size, val, best_val, selection, best_selection, indep_mat);
best_val         1378 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
best_val         1388 ompi/mca/topo/treematch/treematch/tm_tree.c int  select_independent_groups_by_largest_index(group_list_t **tab_group, int n, int arity, int solution_size, double *best_val, group_list_t **best_selection, int bound, double max_duration)
best_val         1402 ompi/mca/topo/treematch/treematch/tm_tree.c     nb_groups += test_independent_groups(tab_group, i+1, n, arity, 1, solution_size, val, best_val, selection, best_selection);
best_val         1423 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
best_val         1505 ompi/mca/topo/treematch/treematch/tm_tree.c 		 double *best_val, tm_tree_t **cur_group, int *nb_groups, int max_groups)
best_val         1521 ompi/mca/topo/treematch/treematch/tm_tree.c     if( val < *best_val ){
best_val         1522 ompi/mca/topo/treematch/treematch/tm_tree.c       *best_val = val;
best_val         1546 ompi/mca/topo/treematch/treematch/tm_tree.c     fast_group(aff_mat, tab_node, parent, i, arity, n+1, best_val, cur_group, nb_groups, max_groups);
best_val         1560 ompi/mca/topo/treematch/treematch/tm_tree.c   double best_val, val=0;
best_val         1564 ompi/mca/topo/treematch/treematch/tm_tree.c     best_val = DBL_MAX;
best_val         1569 ompi/mca/topo/treematch/treematch/tm_tree.c     fast_group(aff_mat, tab_node, &new_tab_node[l], -1, arity, 0, &best_val, cur_group, &nb_done, MAX(10, (int)(50-CmiLog2(nb_groups))-solution_size/10));
best_val         1570 ompi/mca/topo/treematch/treematch/tm_tree.c     val += best_val;
best_val         1574 ompi/mca/topo/treematch/treematch/tm_tree.c     if(new_tab_node[l].val != best_val){
best_val         1576 ompi/mca/topo/treematch/treematch/tm_tree.c 	    printf("Error: best_val = %f, new_tab_node[%d].val = %f\n", best_val, l, new_tab_node[l].val);
best_val         1775 ompi/mca/topo/treematch/treematch/tm_tree.c   double best_val, last_best;
best_val         1839 ompi/mca/topo/treematch/treematch/tm_tree.c     best_val = DBL_MAX;
best_val         1843 ompi/mca/topo/treematch/treematch/tm_tree.c     timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 1, 100);
best_val         1849 ompi/mca/topo/treematch/treematch/tm_tree.c     best_val /= 1.001;
best_val         1858 ompi/mca/topo/treematch/treematch/tm_tree.c     last_best = best_val;
best_val         1859 ompi/mca/topo/treematch/treematch/tm_tree.c     timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1);
best_val         1865 ompi/mca/topo/treematch/treematch/tm_tree.c       if(last_best>best_val){
best_val         1871 ompi/mca/topo/treematch/treematch/tm_tree.c     last_best=best_val;
best_val         1872 ompi/mca/topo/treematch/treematch/tm_tree.c     timeout=select_independent_groups_by_largest_index(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1);
best_val         1876 ompi/mca/topo/treematch/treematch/tm_tree.c       if(last_best>best_val)
best_val         1898 ompi/mca/topo/treematch/treematch/tm_tree.c       last_best = best_val;
best_val         1899 ompi/mca/topo/treematch/treematch/tm_tree.c       timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1);
best_val         1905 ompi/mca/topo/treematch/treematch/tm_tree.c 	if(last_best>best_val)
best_val         1914 ompi/mca/topo/treematch/treematch/tm_tree.c       last_best = best_val;
best_val         1915 ompi/mca/topo/treematch/treematch/tm_tree.c       thread_exhaustive_search(tab_group, nb_groups, arity, solution_size, &best_val, best_selection);
best_val         1918 ompi/mca/topo/treematch/treematch/tm_tree.c 	if(last_best>best_val){
best_val         1919 ompi/mca/topo/treematch/treematch/tm_tree.c 	  printf("Exhaustive search improved solution by: %.3f\n",(last_best-best_val)/last_best);