Searched refs:bound (Results 76 - 100 of 118) sorted by relevance

12345

/barrelfish-2018-10-04/usr/eclipseclp/Eplex/
H A Deplex_coin.h226 EXTERN_C int coin_get_bestmipbound(COINprob * lp, double * bound);
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dfd_arith.pl1271 ineq_res(L, 6, _, _) :- % bound later
1329 insert_suspension([A|B], Susp, bound of suspend, suspend)
1627 insert_suspension(Vars, Susp, bound of suspend, suspend),
1829 insert_suspension(Goal, Susp, bound of suspend, suspend),
H A Dsetof.pl94 % If the Generator contains free variables which are not bound in the
H A Dmodes.pl609 % least upper bound of 2 modes (cf. lattice above)
836 % - in case one argument is not bound by the builtin, use '-' in the exit mode
H A Dlinearize.pl103 be bound to symbolic expressions rather than numbers, they must be
465 variables. If you intend to have variables which can be bound
/barrelfish-2018-10-04/lib/devif/backends/net/e10k/
H A De10k_devif_vf.c72 bool bound; member in struct:vf_state
H A De10k_queue.h89 bool bound; member in struct:e10k_queue
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dfdglobal.tex206 to derive bound updates.
H A Dsolverinter.tex197 position, which will only be bound at runtime:
H A Dobsman.tex102 The branch-and-bound functionality can now be found in more generic
266 it is bound to the list of elements and integer intervals
341 The solution is found using the {\it branch and bound} method;
344 When a new better solution is found, the bound is updated and
379 however the branch and bound method
676 lower domain bound from a list of domain variables.
928 This shows the advantage of the {\it branch and bound} method.
1225 If {\it DVar} is instantiated, {\it Attrib} is bound to an attribute
1231 If {\it DVar} is instantiated, {\it Dom} is bound to
2265 however neither bound ca
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsarith.tex184 which constitute a safe lower and upper bound for the real number that
441 must be bound to numbers at runtime, not symbolic expressions.
450 To make it work even when the argument gets bound to a symbolic expression
H A Dumsdebug.tex826 %bound to a constant or a compound term. Then the debugger displays
829 %on the type of the clause whose head unification has bound the
836 %Variable to be bound (Name or _[lg]NNN): _X\(<NL>\)
837 %Variable has been bound to [3|L] in
842 %bound. In this case the debugger prints a message and traces the next
851 %Variable to be bound (Name or _[lg]NNN): _1122
856 %Variable will never be bound
H A Dumslanguage.tex335 iterations \about{X} is bound in turn to \about{a}, \about{b}, \about{c},
1150 only variables in the clause head can be bound, the call
1210 in this case then the variable is normally bound.
H A Dumsintro.tex229 %variables is bound and the delay condition is then verified again.
H A Dumsterm.tex219 A variable is instantiated when it has been bound to an atomic or a
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex501 \index{placeholder variables}If we do not specify a fixed attribute value when the named structure is created, then its value will be a free variable which can be bound later on. This is useful for two main purposes. On one side we can define attributes of a structure which will hold the constraint variables\index{constraint variables} of a problem, on the other side we can leave some attributes initially unassigned so that we can fill these slots with results of a computation later on.
671 \index{iteration, list}\index{list}This concept is used to perform some action on each element of a list. There are two implementations given here. The first uses the {\it do}\index{do loop}\index{loop} loop of ECLiPSe, the second uses recursion\index{recursion} to achieve the same purpose. In the {\it do} loop, the {\it foreach}\index{foreach} keyword describes an action for each element of a list. The first argument (here $X$) is a formal parameter\index{formal parameter} of the loop. At each iteration, it will be bound to one element of the list. The second argument is the list over which we iterate.
847 \item[K] a free variable, will be bound to a list
896 \item[K] a free variable, will be bound to a list
984 \item[Res] a free variable, will be bound to a list
1048 \item[V] a free variable, will be bound to an entry of $L$
1075 \item[Best] a free variable, will be bound to an entry of $L$
1076 \item[Rest] a free variable, will be bound to a list of the entries of $L$ without $Best$
1127 \item[Sum] a free variable, will be bound to a value
1249 \item[K] a free variable, will be bound t
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex206 \index{branch-and-bound}
207 The {\em branch-and-bound} technique works are follows:
217 branch-and-bound primitives bb\_min/3 and bb\_min/6.
758 The branch-and-bound primitives min\_max/6,8 and minimize/6,8 allow
1050 min_max(labeling(Vars), -Profit). % branch-and-bound search
1052 At the end of the problem modelling code, a standard branch-and-bound tree search
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dumscmacros.tex138 {\tt IsRef(tag)} & a variable: it may be bound or unbound. \\
570 or bound to another suspending variable.\\
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/
H A Dchr.pl293 %%%%% Delays on all the variables in inst, bound suspended lists
H A Dchr_doc.pl121 % or/3 - constraint is solved when X is bound to 1
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dlistut.pl368 % in which case the arguments will be bound to lists of length 0, 1, 2, ...
H A Dread.pl53 % Answer. Variables is bound to a list of [Atom=Variable] pairs.
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dic_probe_search.pl139 this upper bound, 'Excess', is the amount by which the resources must
H A Dprobe_search.pl140 this upper bound, 'Excess', is the amount by which the resources must
/barrelfish-2018-10-04/usr/skb/programs/
H A Dglobalthreadalloc.pl132 % data entries to define whether the task is compute or memory bound

Completed in 182 milliseconds

12345