Searched refs:with (Results 151 - 175 of 468) sorted by relevance

1234567891011>>

/barrelfish-master/doc/019-device-drivers/
H A DDeviceDriver.tex32 \vhEntry{0.1}{16.05.2017}{GZ}{Update with info about new driver structure}
65 help you with the process.
74 special in that it communicates with Kaluga to act on requests to
79 It follows a well defined structure that allows Kaluga to interact with an
92 domain can be found in \pathname{usr/drivers/domain/main.c}, with most of the
95 with Kaluga using the ddomain interface (\pathname{if/ddomain.if}).
106 module system uses a custom ELF section (called .bfdrivers) where structs with
116 with the driver domain. Currently, there is no support to dynamically load
118 important that the module is not linked like a regular library with the domain,
142 having a specific, per-instance state coupled with th
[all...]
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsintro.tex6 % in compliance with the License. You may obtain a copy of the License
74 with a focus on hybrid problem solving and solver integration.
98 %{\eclipse} provides the user with the {\bf metaterm} data type which is the key
118 %By default, the toplevel loop and the debugger print variables with
133 %most functionalities can be accessed with a single key stroke.
149 %with external software and it can represent numbers, pointers etc.
173 %is compact and compatible with strings in C, but it also
179 %For special purposes and for communication with external
181 %and global variables which can be modified with destructive
195 %works with key
[all...]
H A Dumsarrays.tex6 % in compliance with the License. You may obtain a copy of the License
41 Obviously, these facilities must be used with care and should always
88 and the stored data can be retrieved as a list with
120 A shelf is an object with multiple slots whose contents survive
132 Data is stored in the slots (or the shelf as a whole) with
134 and retrieved with
175 Stores come in two flavours: anonymous stores are created with
177 and referred to by handle, while named stores are created with a
191 It is also possible to retrieve information: either all keys with
193 or the full contents of the table with
[all...]
H A Dumstkeclipse.tex6 % in compliance with the License. You may obtain a copy of the License
28 multiple windows, menus and buttons to assist the user in interacting with
41 applications with a graphical front end written in Tcl/Tk, replacing the
90 % sets up a matrix with all variables in 1 row. This is the only
115 invoked with the example N-Queens programs for 4 Queens, at the start
120 along with the module it is in. The values of the terms are shown in the
131 with, the tracer. Multiple display matrices can be created to view
134 The following predicates are available in conjunction with the display
150 form, with defaults settings for the extra arguments.
161 associated with i
[all...]
H A Dumsterm.tex6 % in compliance with the License. You may obtain a copy of the License
67 %An array element is selected with a similar term.
72 Atoms are considered as functors with zero arity.
81 written as a conventional identifier (beginning with a lower-case letter), or
180 %element (a ground compound term with as much arguments (integers) as
271 A pair is a compound term with the functor \predspec{./2} (dot)
297 this stands for all (visible) predicates with that name and any arity.
308 (i.e., a compound term with the functor \predspec{:-/2}), or only a fact.
341 There is a functor associated with each
345 or by a compound term (or atom) with thi
[all...]
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dmodelling.tex6 % in compliance with the License. You may obtain a copy of the License
55 is motivated by a fundamental difficulty we face when dealing with
98 sources of error in application development with
135 Specification is mixed with procedural control.
144 \section{Modelling with CLP and \eclipse{}}
146 When modelling problems with constraints, the basic idea is to set up
213 An alternative model is based on the classical decimal addition algorithm with
267 Task = task with [duration:3, resource:R, start:S, name:plumbing]
285 \item[Careful with disjunctions]
H A Dconstimpl.tex6 % in compliance with the License. You may obtain a copy of the License
53 This will succeed with X = 3 after some search.
88 CSPs are a restricted class of constraint problems with the
126 the variables have domain values which are compatible with any
132 Computing networks with these consistency levels can however be a useful
180 in \eclipse{} we usually deal with more heterogeneous situation.
197 Individual constraints can then be implemented with different behaviours,
210 when invoked with uninstantiated variable, is also implemented by the
234 with domain variables. Consider {\bf ic}'s disequality constraint \verb.#\=. :
300 (there is no value for X which is compatible with i
[all...]
H A Dumsterm.tex6 % in compliance with the License. You may obtain a copy of the License
33 Atoms are considered as functors with zero arity.
35 {\it Name} with arity {\it Arity}.
161 {\bf Name} with arity {\bf Arity}.
184 i.e. a compound term with the functor {\it :-/2}, or only a fact.
H A Dhybrid.tex6 % in compliance with the License. You may obtain a copy of the License
92 solvers communicate with each other, thus further speeding up constraint
121 We start with a simple example of linear constraints being posted to
128 \item Exactly one of {\em task1} and {\em task2} overlaps with {\em
148 % Bool is 1 if the task with start time Start and duration
161 % the task with start time Start and duration Duration is
171 % exactly one of task 1 with duration 3 and task 2 with
179 % task 1 with duration 3 and task 2 with duratio
[all...]
H A Dicintro.tex6 % in compliance with the License. You may obtain a copy of the License
23 \chapter{Getting started with Interval Constraints}
28 works with both integer and real interval variables.
71 that support optimization in conjunction with any \eclipse{} solver.
79 \item Create the variables with their initial domains
85 The idea is to associate a digit (0-9) with each letter so that the
95 % Assign a finite domain with each letter - S, E, N, D, M, O, R, Y -
304 Figure~\ref{general-constraints}. These constraints can be used with either
374 Compare with the corresponding bounds consistency constraint:
482 in an expression context and as such should provide a version with a
[all...]
H A Dfdintro.tex6 % in compliance with the License. You may obtain a copy of the License
23 \chapter{Getting started with Finite Domains}
65 \item Create the variables with their initial domains
72 The idea is to associate a digit (0-9) with each letter so the
83 % Assign a finite domain with each letter - S, E, N, D, M, O, R, Y -
106 to define that some colours fit with each other and others do
112 fit with each other:
127 can be defined in ECLiPSe. They are different solutions with different
250 with all currently imposed constraints.
279 schedule tasks with thei
[all...]
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dforall.pl7 % in compliance with the License. You may obtain a copy of the License
56 iterate starting with In=First until Out=Last.
60 iterate with X ranging over all elements of List
65 iterate with X ranging over all elements of List
83 for declaring variables in Goal global, ie shared with the context.
H A Dtest_util.pl7 % in compliance with the License. You may obtain a copy of the License
85 Use this library as follows: Write a file with test patterns, using
100 Alternatively, you can write a file with test patterns, using the
161 first solution of Goal is committed to, and CheckGoal executed with
164 To allow verification of goals with multiple solutions, one special
171 will be executed with the variable instantiations of this solution, and
172 with SolCountVar instantiated to the number of this solution (starting
174 executed, with SolCountVar instantiated to the total number of solutions.
279 predicate (with all compile-time transformations applied), which in turn
596 % type generation predicates -- avoid problems with smar
[all...]
H A Dfd_chip.pl7 % in compliance with the License. You may obtain a copy of the License
94 dom(_{fd:(fd with domain:D)}, List) :-
191 % find the List element with the smallest lower bound
H A Dcio.pl7 % in compliance with the License. You may obtain a copy of the License
85 % with any stream number or stream name, even one that has not been
86 % created with a see/tell. Also, seeing/1 and telling/1 return
H A Dhttp.pl7 % in compliance with the License. You may obtain a copy of the License
63 This DCG grammar may have to be modified with the evolutions of
/barrelfish-master/usr/eclipseclp/documents/megalog/
H A Dkernel-lst.tex6 % in compliance with the License. You may obtain a copy of the License
86 \item[bang_retrieve_delete(+RelName, ?Tuple, +Condition)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.}
88 \item[bang_retrieve_delete(+RelName, ?Tuple, +Condition, +Test)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.}
136 %\item[transaction_commit]{Commit a transaction started with {\pbf transaction_start/0}.}
140 %\item[transaction_undo]{Undo a transaction started with {\pbf transaction_start/0}.}
/barrelfish-master/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex6 % in compliance with the License. You may obtain a copy of the License
70 Thus the platform supports experimentation with different hybrid
121 may vary with the time of day, and anyway the poor salesmen need some
139 with different hybrid algorithms until an appropriate one is found
191 concerned with {\em constructive} search, and the second with {\em
198 In this case the new choice is typically compared with the previous
202 necessarily consistent with the constraints. The idea of changing the
232 As an example consider the map colouring program, with four countries
332 We briefly compare \ECL as a modelling language with forma
[all...]
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dclients.tex6 % in compliance with the License. You may obtain a copy of the License
49 When running a visualisation-annotated {\eclipse} program with a Java
53 running of the program and wait for user interaction with the VC
123 \item Textually, as though the element had been printed with
131 \item As an edge in a graph, with the textual representation attached
144 \caption{The FD variable with initial domain 0..10, reduced to 3..5 as
156 Upon a \viewable{} being created, the user is presented with a dialog
158 \viewable{} with.
187 \item[Gantt] Interprets the first three rows of any 2D viewable with
263 Contains convenience commands for dealing with th
[all...]
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dcardinal_functions.pl7 % in compliance with the License. You may obtain a copy of the License
29 % decision by deleting the provisions above and replace them with the notice
75 % Check if each of the optional Functions agrees with ground Set.
/barrelfish-master/doc/015-disk-driver-arch/
H A Dfuture.tex10 \section{Integration with the System Knowledge Base}
24 It would be prefereable if on systems with multiple controllers attached all of
45 however is more challenging. Outstanding requests have to be completed with an
H A Dblockdevfs.tex9 The filesystem only consists of a single directory with no nested directories.
24 with two entries. \lstinline+prev+ and \lstinline+next+ are used to implement
53 \item \lstinline+close(void *handle)+ to close a previously opened file. As with open, blockdevfs takes care of manipulating its structures.
62 All functions are supplied with the backend-handle associated with the
84 \emph{ata0} for the device with unique id $0$. Keep in mind that \emph{ahcid}
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Dic_probe.pl6 % in compliance with the License. You may obtain a copy of the License
52 Options = options with [granularity:Gran,priority:Priority],
135 Options=options with priority:Priority,
169 (foreach(task with [start:S,duration:D], Tasks),
234 finite domain variables in the term <B>Tasks</B> are associated with a demon
238 <B>lp_demon_setup</B> is then invoked to set up the linear solver, with the
253 args :["Constraint": "A numerical constraint, with functor
H A Dprobe.pl6 % in compliance with the License. You may obtain a copy of the License
52 Options = options with [granularity:Gran,priority:Priority],
134 Options=options with priority:Priority,
167 (foreach(task with [start:S,duration:D], Tasks),
233 finite domain variables in the term <B>Tasks</B> are associated with a demon
237 <B>lp_demon_setup</B> is then invoked to set up the linear solver, with the
252 args :["Constraint": "A numerical constraint, with functor
H A Drepair.pl6 % in compliance with the License. You may obtain a copy of the License
32 % We consider variables with variable tentative value tenable. That's
100 mon, % set element with suspension of monitor_tenable goal
134 search with the constraint consistency checking techniques of ECLiPSe. It
155 Normally, the repair library communicates with another solver (such as fd or
467 as with r_conflict/2, monitors the constraint for conflicts. The difference
474 with annotation.
692 % variable is unified with another variable.
694 % the goal is only created for variables with a ground tentative value
747 variables with tentativ
[all...]

Completed in 180 milliseconds

1234567891011>>