Searched refs:reduce (Results 1 - 25 of 31) sorted by last modified time
12
/barrelfish-2018-10-04/usr/tests/phoenix_tests/ |
H A D | kmeans.c | 397 // Setup map reduce args 401 map_reduce_args.reduce = kmeans_reduce;
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | probe_search.pl | 268 the given task so as to reduce the number of overlapping tasks.
|
H A D | ic_probe_search.pl | 267 the given task so as to reduce the number of overlapping tasks.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsmemory.tex | 199 The only way to reduce Control Stack usage is to avoid unnecessary 246 Ways to reduce Trail Stack consumption are
|
H A D | umscompiler.tex | 214 will disable certain compiler optimizations and usually reduce performance. 803 improve indexing and to reduce code size.
|
H A D | umsarrays.tex | 48 state) and reduce the risk of memory leaks.
|
H A D | extmeta.tex | 188 this optimization (some systems can reduce these chains
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | solversintro.tex | 116 resource level. They reduce the finite domains of the task start times
|
H A D | search.tex | 485 placing queens in the middle of the board to reduce the number of
|
H A D | real.tex | 333 Other times, propagation will reduce the domains of the variables to
|
H A D | modelling.tex | 65 algorithms that reduce the need for search. 231 constraints. Even though high-level models reduce the need for finding
|
H A D | hybrid.tex | 714 \Note{The definition of the reduce cost here is the one used by the eplex 964 To test its performance, reduce the domains thus:
|
H A D | eprolog.tex | 79 To reduce the need for auxiliary recursive predicates, \eclipse{} allows
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 480 placing queens in the middle of the board to reduce the number of
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | obsman.tex | 1916 if the colour is known, and reduce the colour values
|
H A D | introduction.tex | 96 resource level. They reduce the finite domains of the task start times
|
H A D | ic.tex | 1280 remove a value, reduce the upper bound or increase the lower bound of a
|
H A D | gfd.tex | 232 This could reduce the cost of performing the propagation.
1023 The binary-choice methods create two search alternatives, which reduce the variable domain
1408 state; instead, the previous state is recomputed. To reduce the amount
|
H A D | extfd.tex | 1810 if the colour is known, and reduce the colour values
|
H A D | eplex.tex | 526 setup of the problem to reduce overheads.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/ |
H A D | eclipse.tex | 203 choices is to reduce the number of constraint violations until all 842 tough challenge to reduce this time from hours to minutes! 1749 it repeatedly attempts to reduce the domains of its variables further 1751 any other constraints reduce any of these domains.
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | kernel.pl | 1061 /* Value used as a filter to reduce DbRef returned */
|
H A D | kernel_bips.pl | 362 % sorting the list first is not necessary, but likely to reduce
|
/barrelfish-2018-10-04/tools/harness/ |
H A D | builds.py | 149 e = reduce(split_reduce_env, e, (False, ['']))[1]
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | tommath.tex | 1441 is zero. Next we set the digit and reduce it modulo $\beta$ (line 22). After this step we have to 1445 We can quickly reduce modulo $\beta$ since it is of the form $2^k$ and a quick binary AND operation with 2445 Recalling that reducing modulo $2^k$ and a binary ``and'' with $2^k - 1$ are numerically equivalent we can quickly reduce 2446 the number. First we zero any digits above the last digit in $2^b$ (line 42). Next we reduce the 2647 after the nested loop to reduce the amount of work requiored. Succintly the first step of the algorithm is to compute 2780 reduce the memory bandwidth to two \textbf{mp\_digit} reads per iteration. 3034 chosen such that $\zeta$ is easy to compute and the resulting system of equations easy to reduce. Here, the points $\zeta_{0}$, 3679 reduce the number. 3688 See~\ref{sec:division} for further details.} might as well be used in its place. The key to optimizing the reduction is to reduce the precision of 3741 After the quotient has been calculated it is used to reduce th [all...] |
Completed in 195 milliseconds
12