/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | ic_make_overlap_bivs.pl | 36 In principle a bivalued variable is set up between each pair of tasks. 228 tentative assignment feasible. In case a bottleneck task has a
|
H A D | make_overlap_bivs.pl | 36 In principle a bivalued variable is set up between each pair of tasks. 228 tentative assignment feasible. In case a bottleneck task has a
|
/barrelfish-master/doc/008-tracing/ |
H A D | Tracing.tex | 78 In addition it supports various export functionalities that allow you to analyze 86 has been started. In order to break as little as possible in existing code to 89 tracing framework. In the end the structure of the trace logs that are generated 93 In this section we want to look at the part of the tracing framework that is 137 also be extended, a possible idea would be to store the trace log in a file. In 168 In addition to the Subsystem, Event and Argument information, the tracing 211 \ref{lst:pleco-file}. In this file we define two Subsystems: \texttt{kernel} and 263 Listing \ref{lst:headerfile} has been generated during the build process. In 406 triggered by manually calling the according trace framework function. In 477 visualization code for custom developer scripts. In Sectio [all...] |
/barrelfish-master/doc/011-idc/ |
H A D | IDC.tex | 184 In contrast to an alias, the \texttt{typedef} keyword causes a new type 363 In the examples that follow, we assume that a Flounder interface 378 In order to communicate, two dispatchers must establish a communication channel 390 In any binding attempt, one dispatcher must act as server and the other as 397 In order to accept binding requests, a dispatcher must first export a service. 419 use the iref to initiate a binding to the service. In order for the service to 437 In order to initiate a binding, a client dispatcher calls the \emph{bind} 597 binding is not currently able to accept another message. In this case, the user 705 such as the ability to receive a message on a specific channel. In the 850 In genera [all...] |
/barrelfish-master/usr/eclipseclp/Opium/demo/ |
H A D | yoyo2.pl | 30 In addition I changed the representation of the graph.
|
/barrelfish-master/usr/eclipseclp/Opium/ |
H A D | opium_light_kernel_patch.pl | 77 In Opium the very first line of each execution is always
|
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | obsman.tex | 941 In the above example the constraints are simply built-in predicates. 1256 {\bf NOTE:} In the {\bf fd.pl} library the suspension lists 1263 In this way, user-defined constraints can rely on the fact that 1475 In this section we present some FD programs that show various 1569 In this case we use the available primitive in the fd library. Whenever 1712 In this way, no special constraints are needed and 1761 In this type of problems the goal is to pack a certain amount of 1908 In most programs, however, it is not necessary to 2009 {\bf contained_in(Color, Component, In)} states that 2010 if Color is different from In, ther [all...] |
H A D | gfd.tex | 120 In GFD, as in IC, booleans (such as the boolean in reified constraints) are
149 In addition to propagating constraints at a unspecified or default level,
177 consistency levels. In fact, a consistency level can be specified for
180 supported at the given consistency level. In such cases, these sub-expressions
204 In this particular example, using the stronger propagation actually results in
223 triggered explicitly. In GFD, triggering propagation in the Gecode solver state
248 (as used in \bipref{collection_to_list/2}{../bips/lib/lists/collection_to_list-2.html}). In some cases, the elements in the collection are required to be
265 In general, any collection argument can be supplied as a nested collection
266 (e.g. nested listed or multi-dimensional arrays). In some
276 element representing the column elements in that row. In arra [all...] |
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | constimpl.tex | 54 In this example, both the member/2 goal and the inequality goal could 72 In the following, we will call a predicate a {\bf constraint} only if it 94 is allowed to take. In general, this can be an arbitrary, unordered 108 In such a network, several levels of consistency can be defined: 121 other variable in the constraint. In practice, constraints 141 In practice, the most relevant consistency level is arc-consistency. 233 are instantiated. In particular, this is the case when we are working 306 In terms of the search tree, this means that a branch will not be pruned
|
H A D | search.tex | 29 In this chapter we will take a closer look at the principles and 50 In the following, we will use the following terminology: 234 In the following sections we will first investigate the considerable 272 In general, the nodes of a search tree represent {\em choices}. 277 In other words, the original problem is reduced to a disjunction 280 In the case of finite-domain problems, the most common form of choice 287 In {\eclipse}, this can be written as a disjunction 313 In the following examples, we will mainly use simple labeling, 726 tree. In many constraint problems with a fixed number of variables 815 In a [all...] |
H A D | icintro.tex | 323 In the above example, since the lower bound of \texttt{Y} is 0 and 422 In this mode no variable domains are modified but checks are made to 527 In the above example, once it is known that \texttt{X \#=< Y - 6} cannot be 680 In a similar vein, the \texttt{ic_cumulative}, \texttt{ic_edge_finder} and 751 In this case we use the \verb0element/30 predicate, 815 In this type of problem the goal is to pack a certain amount of 877 In modelling this problem we need to refer to an array of quantities 1157 fromto(1, In, Out, 1) 1159 In #= (X #< Y + Out)
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsdeveltools.tex | 56 In addition, \eclipse{} provides several tools that aid in the 323 In particular, an {\eclipse} source file can be converted into an 422 executing the goal. In fact in the above example the profiler was 467 In the above example, the profiler takes over three hundred samples 469 the program. In this instance we can see that more than half of the 482 model that the debugger uses, see chapter \ref{boxmodel}). In this 576 In order to add the coverage counters to code, it must be compiled with 753 In summary, the programmer must verify that the suggested modes are correct
|
H A D | umsmodules.tex | 42 In particular, this helps with 51 In constraint programming it is quite common to have different 210 In order to use a definition that has been exported elsewhere, it has 271 \item In every module, at most one definition is 384 module and both are needed. In this case, none of the conflicting 505 files. In this case, there should be a main file whose file name 533 In {\eclipse}, predicates that must be able to determine their caller module 647 In case that the built-in predicate has to be executed in
|
H A D | umsmemory.tex | 39 In a high level language like Prolog it is often not obvious for the programmer 87 In the following we will discuss the six memory areas mentioned. 207 In this case it should be checked whether the nondeterminism was intended. 225 In coroutining mode, delayed goals also consume space on the Global Stack. 261 In addition, {\eclipse} provides an incremental garbage collector
|
H A D | umssyntax.tex | 457 In Prolog, the user is able to modify the syntax dynamically by explicitly 489 In the associativity specification of an operator (e.g., \notation{fx}, 536 In order to decide whether that is the case, {\eclipse} uses the operator's 539 the prefix is treated as a simple atom. In the rare case where this 546 both infix and postfix. In this case, {\eclipse} uses a one-token 579 In addition to the above extensions, the following minor differences 582 \item In {\eclipse}, end of file is accepted as fullstop.
|
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | struct.pl | 18 These routines view a term as a data-structure. In particular, 134 /* In order to handle statements and expressions which contain variables,
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | cgi.pl | 63 If there is a problem, the predicate fails. In that case, the caller should
|
H A D | suspend.pl | 284 translate_goal((Goal, Goals), (NewGoal, NewGoals), Out, In, BOut, BIn) :- !, 285 translate_goal(Goal, NewGoal, Mid, In, BMid, BIn), 287 translate_goal((Goal -> Goals), (NewGoal -> NewGoals), Out, In, BOut, BIn) :- !, 288 translate_goal(Goal, NewGoal, Mid, In, BMid, BIn), 292 [Out], In, [BOut], BIn) :- !, 293 translate_goal(Goal, NewGoal, VarsL0, In, BVarsL0, BIn), 297 translate_goal(Goals, NewGoals, VarsR0, In, BVarsR0, BIn), 305 ( Vars = [Var] -> Out = [Var|In], BOut = BIn 306 ; BOut = [Vars|BIn], Out = In 309 [Out], In, [BOu [all...] |
H A D | elipsys.pl | 325 is different. In MegaLog the first is a declaration, the 326 second a goal. In Sepia it is seen as a single declaration 982 maplist_body(Pred, In, Out, Module) :- 983 findall(Sol, map_elements(Pred, In, Sol, Module), Out0), 987 map_elements(Pred, In, I-Xout, Module) :- 990 InArr =.. [in|In],
|
H A D | linearize.pl | 408 % In a normalised monomial, the list is sorted, the first element is 418 % In a normalised polynomial, all monomials are normalised and 448 In a <EM>normalised monomial</EM>, the list is sorted, the first element is 458 In a normalised polynomial, all monomials are normalised and 880 (foreach(C0*V0,Lin0), param(C), fromto(Lin1,Out,In,[]) do 882 Out = [C1*V0|In]
|
/barrelfish-master/doc/015-disk-driver-arch/ |
H A D | design.tex | 3 In order to be able to register as a \acs{pci} device driver, some sort of 20 In such a design, all port memory access, including issuing of commands, would
|
H A D | intro.tex | 2 and SAS host bus adapters. In order to provide backwards-compatibility, 51 device or a port multiplier. In this lab project, we focus on device handling
|
/barrelfish-master/doc/009-notifications/ |
H A D | Notify.tex | 91 heavyweight blocking mechanism. In the current tree this involves 111 set of URPC channels which currently have pending messages. In Nemesis 119 In a many-core environment, a single hint FIFO would potentitally be 132 In the global kernel data page have an array of pointers to per-core 197 In all of the above cases, I would imagine that notifications would
|
/barrelfish-master/usr/eclipseclp/documents/embedding/ |
H A D | embremoteproto.tex | 85 side, execution is suspended while it does not have control. In general, once a 111 without transferring control. In fact, if the remote language is 134 and \bipref{remote_connect_accept/6}{../bips/kernel/externals/remote_connect_accept-6.html} pair. In fact, {\bf remote_connect/3} is implemented using {\bf 159 is using. In order to cope with remote connections which may not be using 245 the information can be transmitted either manually or via files. In 249 In accepting client socket connections from the remote side, the {\eclipse} 261 remote side. In this case, the remote side is also an {\eclipse} program. 344 In addition to the attachment, the example contains a very simple example 390 In this simple example, when control is returned to remote side, it 528 the diagram. In suc [all...] |
/barrelfish-master/usr/skb/programs/ |
H A D | decoding_net3_multid.pl | 57 (foreach(Reg, RegLi), fromto([0], In, Out, Ptz) do 60 append(In, [B,LP], Out) 139 region{node_id:["In"], blocks:[memory, [block{base:1000,limit:2000}]]}, 141 overlay(["In"], ["Out2"]) 143 Src = region{node_id:["In"]}, 149 region{node_id:["In"], blocks:[memory, [block{base:1000,limit:2000}]]}, 152 region{node_id:["In"], blocks:[memory, [block{base:0,limit:999}]]}, 156 region{node_id:["In"], blocks:[memory, [block{base:2001,limit:Inf1}]]}, 171 %%% ["In"], [memory, [block{base:1000,limit:2000}]], 173 %%% does_not_translate(["In"], [memor [all...] |