/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe.pl | 43 Solvers - A list of solvers - [ic,linear] or any subset 80 add_ineq(linear(Handle),ConsList) :- 87 %add_ineq(linear(Handle),ConsList) :- 123 set_up_probe simply adds all the constraints to the linear solver. 151 add_con(Constraints,[linear(Handle)], Options). 209 This implementation of probing is a call to an external linear solver, 220 summary : "Sets up a linear probe for a set of constraints", 227 used by the linear solver" 233 ic and linear solvers. The cost is declared to be an integer. All the 235 which forwards their bounds to the linear solve [all...] |
H A D | probe.pl | 43 Solvers - A list of solvers - [fd,linear] or any subset 80 add_ineq(linear(Handle),ConsList) :- 87 %add_ineq(linear(Handle),ConsList) :- 122 set_up_probe simply adds all the constraints to the linear solver. 150 add_con(Constraints,[linear(Handle)], Options). 208 This implementation of probing is a call to an external linear solver, 219 summary : "Sets up a linear probe for a set of constraints", 226 used by the linear solver" 232 fd and linear solvers. The cost is declared to be an integer. All the 234 which forwards their bounds to the linear solve [all...] |
H A D | ic_probe_search.pl | 116 (Biv=0,add_con([S1>=S2+D2],[ic,linear(Handle)],Options) 119 add_con([S1>=S2,S1<S2+D2],[ic,linear(Handle)],Options) 122 add_con([S2>S1],[ic,linear(Handle)],Options) 308 "Handle":"A linear solver handle"
|
H A D | ic_probing_for_scheduling.pl | 207 add_con(Constraints,[ic,linear(Handle)],Options). 260 write(error,'Error: the cost function has a non-linear part: '), 452 variables by the list of linear constraints. The user can add not only 453 linear constraints on the cost function, but also constraints between the
|
H A D | probe_search.pl | 117 (Biv=0,add_con([S1>=S2+D2],[fd,linear(Handle)],Options) 120 add_con([S1>=S2,S1<S2+D2],[fd,linear(Handle)],Options) 123 add_con([S2>S1],[fd,linear(Handle)],Options) 309 "Handle":"A linear solver handle"
|
H A D | probing_for_scheduling.pl | 207 add_con(Constraints,[fd,linear(Handle)],Options). 260 write(error,'Error: the cost function has a non-linear part: '), 452 variables by the list of linear constraints. The user can add not only 453 linear constraints on the cost function, but also constraints between the
|
H A D | eplex_relax.pl | 57 % The piecewise linear (convex hull) constraint 67 % the piecewise linear specification which are feasible with respect to the 69 % intersects a segment from the piecewise linear constraint. 984 % Evaluate the piecewise linear function at the given point.
|
H A D | ic_probing_tests.pl | 191 %%% Priority of linear probe demon
|
H A D | probing_tests.pl | 189 %%% Priority of linear probe demon
|
/barrelfish-master/usr/drivers/vbe/ |
H A D | main.c | 83 bool linear = 0; local 84 uint32_t r = vbe_getmode(&mode, &linear); 86 errval_t err = b->tx_vtbl.get_vesamode_response(b, NOP_CONT, mode, linear, 92 bool linear, bool clear) 94 uint32_t r = vbe_setmode(mode, linear, clear); 91 set_vesamode(struct fb_binding *b, uint16_t mode, bool linear, bool clear) argument
|
H A D | vbe.h | 110 uint32_t vbe_setmode(uint16_t mode, bool linear, bool clear);
|
H A D | vbe.c | 93 uint32_t vbe_setmode(uint16_t mode, bool linear, bool clear) argument 97 .ebx = (mode & 0x1ff) | (linear ? 1 << 14 : 0) | (clear ? 0 : 1 << 15) 304 mib.modeattributes & LINEAR_MODE_AVAILABLE ? " linear" : ""); 313 printf("Current mode: 0x%x %s\n", curmode, islinear ? "linear": "windowed");
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | hybrid.tex | 37 linear solver to other variables handled by the domain solver. 62 \item linear numeric constraints 65 The linear constraints are handled by a very powerful solver that 68 %account all the interactions between the different linear constraints. 75 \item the enforcement of global consistency for linear constraints 76 \item the production of an optimal solution satisfying the linear constraints 81 Problems involving only linear constraints are very well handled by 96 from non-linear constraints and thus the linear solver benefits from 104 comprising just the linear constraint [all...] |
H A D | solversintro.tex | 69 These expressions can contain non-linear functions such as $sin$ and built-in 71 %The user can also specify any piecewise linear unary function and {\em ic} 148 external linear programming (LP) / mixed integer programming (MIP) 255 resources and linear constraint solving to reason on cost \cite{HaniProbe}.
|
H A D | eplex.tex | 38 are solver dependent, but currently linear programming, mixed integer 67 important. LP problems have both a linear objective function and linear 83 \item Linear Programming (LP) problems: linear constraints and objective 271 \Note{The arithmetic constraints can be linear expressions on both 272 sides. The restriction to linear
|
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | introduction.tex | 120 The expressions can include non-linear functions such as $sin$, built-in 121 constants such as $pi$. Piecewise linear unary functions are also available. 163 There are two libraries supporting linear constraint solving. The 164 first {\em eplex} provides an interface to external linear 173 external linear solvers (CPLEX \cite{ILOG} and XPRESS \cite{Dash}) 176 linear solver and other \eclipse\ solvers. 185 method for solving linear constraints \cite{Holzbauer}. 192 This library handles any user-defined piecewise linear function as a 194 pruning than the standard handling of piecewise linear constraints 209 resources and linear constrain [all...] |
H A D | eplex.tex | 27 \index{linear programming, interface to|(} 102 to as an {\it eplex problem}. An eplex problem consists of a set of linear 138 \label{linear-constraints} 140 linear expressions. 165 \index{\$=/2@\texttt{\$=/2}!eplex} X is equal to Y. X and Y are linear expressions. 168 \index{\$>=/2@\texttt{\$>=/2}!eplex} X is greater or equal to Y. X and Y are linear expressions. 171 \index{\$=</2@\texttt{\$=</2}!eplex} X is less or equal to Y. X and Y are linear expressions. 270 Objective is either min(Expr) or max(Expr) where Expr is a linear 285 Here is a simple linear program, handled by the predefined eplex instance 'eplex': 738 where Expr is a linear (o [all...] |
H A D | solverinter.tex | 119 example, the eplex solver can only handle linear expressions. Refer 229 An interface to an LP or MIP solver, i.e.\ it implements linear
|
H A D | extfd.tex | 79 \item[linear term] 80 A linear term is a linear integer combination of integer domain variables. 81 The constraint predicates accept linear terms even in a non-canonical form, 91 Note that arithmetic operations on linear terms are performed 95 Both the maximum and minimum value of a linear term must 120 to a linear term. 231 If {\it C} is a linear term, 234 If {\it C} is a list of linear terms, the returned solution 1249 To show that the constraints are not restricted to linear term [all...] |
H A D | ic.tex | 265 limited to linear constraints, so it can be used to solve general problems 277 The IC library treats linear and non-linear constraints 279 whereas non-linear constraints are broken down into simpler 843 As per locate/2, but LinLog specifies wither linear (\texttt{lin}) or 1056 somewhat cheaper linear splitting may be used. In general, log splitting 1147 The number of linear constraints set up. 1149 The number of times a linear constraint is propagated. 1151 The number of times a non-linear (unary/binary/ternary) operator is
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | linearize.pl | 31 % A linear expression is normalised into a list (sum) of the form 39 % normalised linear form. The nonlinear parts are extracted using 45 % lin(Lin) embedded normalised linear expression 48 % linrenorm/2 re-normalises a linear normal form expression after variable 76 summary:"Split and arithmetic expression into linear and nonlinear parts", 83 The linear component of expression is normalised into a list 92 normalised linear form. The nonlinear parts are extracted using 100 where Lin is an already normalised linear expression. All variables 129 summary:"Renormalize a linear form", 135 The normal form of linear expression [all...] |
H A D | fd.pl | 83 <DT>linear term</DT><DD> 84 A linear term is a linear integer combination of integer 85 domain variables. The constraint predicates accept linear 90 Note that arithmetic operations on linear terms are performed 94 maximum and minimum value of a linear term must be 103 result variable in the linear term context. Every subexpression 941 desc:html(" This constraints states that the two linear terms are not equal. It is 947 args:["?X" : "A linear term.", "?Y" : "A linear ter [all...] |
/barrelfish-master/usr/eclipseclp/documents/intro_paper/ |
H A D | eclipse.tex | 78 linear constraint solving. 545 an external solver, written in \verb0C0 to handle linear constraints, 922 The library propagates equations and inequalities between linear expressions. 923 A linear numeric expression is one that can be written in the form 1279 except that {\em fd} can only propagate linear constraints. 1345 This distinguishes {\em ria} constraints from linear and finite domain 1416 This will motivate the introduction of a linear constraint solver in 1456 Equations and inequalities between linear numeric expressions, as 1461 Techniques for solving linear constraints have been at the heart of 1462 operations research for half a century, and highly efficient linear [all...] |
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | internal.tex | 142 \item eplex linear/mip solver, column generation
|
/barrelfish-master/usr/skb/programs/ |
H A D | objects3.pl | 90 sort(Constraints, SConstraints). % Sorting allows us to do matching in linear time
|