/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | fd.pl | 185 minimize/2, 186 minimize/4, 187 minimize/5, 188 minimize/6, 189 minimize/8, 197 :- tool(minimize/2, minimize_body/3), 198 tool(minimize/4, minimize_body/5), 199 tool(minimize/5, minimize_body/6), 200 tool(minimize/6, minimize_body/7), 201 tool(minimize/ [all...] |
H A D | branch_and_bound.pl | 73 Alternatively, we can minimize the item price: 152 minimize/2, 163 minimize(0,*), 195 :- tool(minimize/2, minimize/3). 196 minimize(Goal, Cost, Module) :- 637 :- comment(minimize/2, [ 644 template:"minimize(+Goal, ?Cost)", 765 cost variable in your model and minimize that instead, e.g. 1008 cost variable in your model and minimize tha [all...] |
H A D | cp_min.pl | 45 of minimize/5).
|
H A D | elipsys.pl | 149 minimize/1. 1104 minimize(On) :- getval(minimize_verbose,On).
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ilog/ |
H A D | fd_min_max.pl | 38 minimize/2, 39 minimize/4, 40 minimize/5, 41 minimize/6, 42 minimize/8, 52 :- tool(minimize/2, minimize_body/3), 53 tool(minimize/4, minimize_body/5), 54 tool(minimize/5, minimize_body/6), 55 tool(minimize/6, minimize_body/7), 56 tool(minimize/ [all...] |
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | multicast.pl | 101 % minimize the value of the longest latency 104 minimize(multicast_tree_cost(StartCore, SendList, Cost), Cost).
|
H A D | threadallocation.pl | 66 minimize(nextsol(CoreIDs, Start, End, List, C), C).
|
H A D | scheduler.pl | 119 minimize(add_sync(SyncThreads, NrCores, Threads, RemSync, RemCores),RemCores), 130 minimize((assign_coreids(SP, CoreIDs, SPC),assigned_coreids_cost(SPC,Cost)), Cost), 160 minimize(add_nosync_block(NoSyncThreads, NrCores, Threads, RemT, RemCores), RemCores),
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extfd.tex | 246 \item[] \biptxtref{minimize(+Goal, ?Term)}{fd:minimize/2}{../bips/lib/fd/minimize-2.html}\ \\ 247 \index{minimize/2!fd} 252 Often \bipref{minimize/2}{../bips/lib/fd/minimize-2.html} is faster than \bipref{min_max/2}{../bips/lib/fd/min_max-2.html}, sometimes 257 \item[] \biptxtref{minimize(+Goal, ?Template, ?Solution, ?Term)}{fd:minimize/4}{../bips/lib/fd/minimize-4.html}\ \\ 259 \index{minimize/ [all...] |
H A D | obsman.tex | 351 \item[] \biptxtref{minimize(+Goal, ?Term)}{fd:minimize/2}{../bips/lib/fd/minimize-2.html}\ \\ 352 \index{minimize/2!fd} 357 Often \bipref{minimize/2}{../bips/lib/fd/minimize-2.html} is faster than \bipref{min_max/2}{../bips/lib/fd/min_max-2.html}, sometimes 362 \item[] \biptxtref{minimize(+Goal, ?Template, ?Solution, ?Term)}{fd:minimize/4}{../bips/lib/fd/minimize-4.html}\ \\ 364 \index{minimize/ [all...] |
/barrelfish-2018-10-04/lib/pcre/ |
H A D | pcre_exec.c | 526 BOOL minimize, possessive; /* Quantifier options */ local 751 minimize = possessive = FALSE; 2753 minimize = (c & 1) != 0; 2761 minimize = (*ecode == OP_CRMINRANGE); 2811 if (minimize) 2896 if (c < OP_CRPOSSTAR - OP_CRSTAR) minimize = (c & 1) != 0; 2906 minimize = (*ecode == OP_CRMINRANGE); 2971 if (minimize) 3123 if (c < OP_CRPOSSTAR - OP_CRSTAR) minimize = (c & 1) != 0; 3133 minimize [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | colgen.tex | 30 1-dimensional cutting stock problem --- in which we wish to minimize 64 \mathbf{P:}\ \mathrm{minimize\ }z&=&\displaystyle{\sum_{j=1}^{K_{0}}w_{j}}\\ 171 \mathbf{MP:}\qquad\mathrm{minimize}\qquad z&=&\sum_{\mathbf{q}\in Q}c_{\mathbf{q}}\lambda_{\mathbf{q}}\\ 278 to maximize those with non-negative dual value and minimize those with
|
H A D | hybrid.tex | 256 % minimize Cost by branch-and-bound 257 minimize((Search,eplex_get(cost,Cost)),Cost). 596 % minimize Cost by branch-and-bound 597 minimize((labeling(Bools),eplex_get(cost,Cost)),Cost).
|
H A D | fdintro.tex | 296 \item[minimize(+Goal,-Cost)] 297 \index{minimize/2}
|
H A D | repairtut.tex | 329 minimize(repair_ic(Starts),End).
|
H A D | icintro.tex | 67 branch_and_bound:minimize(labeling(Variables), Objective).
|
H A D | search.tex | 199 \item[minimize(+Goal,-Cost)]
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/asm/ |
H A D | ppc-mont.pl | 123 and $ovf,$ovf,$tj ; minimize TLB usage
|
H A D | ppc64-mont.pl | 199 and $tp,$tp,$i ; minimize TLB usage
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | vbs_router.pl | 89 minimize(naive_label(Vs,RCost), RCost),
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/grace/ |
H A D | grace.pl | 595 minimize((grace_label_list(Vars), grace_solution), Cost, Min, Max, Perc) 640 % Fix the problem with minimize
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | bip_domain.c | 427 int minimize; local 435 minimize = 1; 437 minimize = 0; 470 if (k > 0 && minimize || k < 0 && !minimize)
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/ |
H A D | eclipse.tex | 764 {\em minimize(Min)} simply specifies that 860 minimize(labeling(PocketCoins),Min). 877 optimisation predicate {\em minimize} are implemented in the \ECL 1119 minimize(labeling([X,Y,Z]),X). 1162 Query 7 is an example of the use of the built-in {\em minimize} 1167 labeling([X,Y,Z])} as the first argument to {\em minimize}. 1169 {\em minimize( (indomain(X), indomain(Y), indomain(Z)), X)}. 2129 domain procedure {\em minimize} and the MIP procedure {\em optimize}. 2235 minimize(mylabeling([X,Y,Z,W]),Cost).
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 758 The branch-and-bound primitives min\_max/6,8 and minimize/6,8 allow 1497 \verb'minimize/2' from the finite domains library: 1501 minimize((
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | exthsusp.tex | 887 \bipref{minimize/2}{../bips/lib/branch_and_bound/minimize-2.html}.
|