Searched refs:us (Results 26 - 50 of 60) sorted by relevance

123

/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/
H A Dsparccpuid.S21 ! Keep in mind that this does not excuse us from wiping the stack!
/barrelfish-2018-10-04/doc/023-coreboot/
H A Dcoreboot.tex75 cores much like peripheral devices, and allows us to reuse the OS's existing
339 remove or the core/KCB that is currently hosting us...}
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsstring.tex53 Let us first compare strings with character lists.
H A Dextsuspend.tex169 As an example, let us construct the code for the built-in predicate
301 There is however a possibility for us to do this explicitly:
H A Dextmeta.tex559 As an example, let us implement variables of enumerable types
H A Dexthsusp.tex584 Let us now suppose we want to implement a predicate \predspec{succ/2}, such that
685 This gives us the desirable behaviour of failing as soon as possible:
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dfdintro.tex105 For example, let us assume that we have a set of colours and we want
111 Let us assume we have a symmetric relation that defines which colours
327 Let us solve an example given by Andre Vellino in the Usenet
H A Dicintro.tex691 conjunctions of primitive constraints. For example, let us consider a set
696 Let us assume we have a symmetric relation that defines which product
817 Let us solve an example given by Andre Vellino in the Usenet
H A Dsearch.tex32 constraints. Let us first recall what we are talking about.
481 Let us try to employ a {\bf problem-specific heuristic}:
533 It allows us to specify that we want to start labeling with the middle value
H A Dconstimpl.tex205 Let us now look at examples of different constraint behaviours.
/barrelfish-2018-10-04/doc/008-tracing/
H A DTracing.tex155 Let us now define the structure of events that can be traced. Each event
158 are 16 bit identifiers, allowing us to have up to 65535 Subsystems and for each
172 allowing us to identify the core for an event at a later stage automatically,
511 source allows us to treat different types of data sources uniformly.
532 Let us now look at how events are processed once the TracingSession retrieves a new Event.
/barrelfish-2018-10-04/doc/022-armv8/
H A Dreport.tex437 allow us to avoid multiplexing IDs among active processes, on any
488 of the current dispatcher structure will allow us to avoid both a memory load
956 \autoref{s:threads}, the extra instructions required do constrain us somewhat,
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextfd.tex739 Let us show a solution for this problem generalised to N queens
1377 For example, let us assume that we have a set of colours and we
1383 Let us assume we have a symmetric relation that defines which
1657 Let us solve an example given by Andre Vellino in the Usenet
H A Dobsman.tex844 Let us show a solution for this problem generalised to N queens
1483 For example, let us assume that we have a set of colours and we
1489 Let us assume we have a symmetric relation that defines which
1763 Let us solve an example given by Andre Vellino in the Usenet
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/
H A Dannotate.tex173 Let us expand our example by assuming that, during the program run our
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/
H A Dapps.c2468 static JPAKE_CTX *jpake_init(const char *us, const char *them, argument
2486 ctx = JPAKE_CTX_new(us, them, p, g, q, bnsecret);
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dcardinal_comments.pl104 Let us now consider for U={a,b,c,d}, the sub-lattice connecting {a,b,d} and {b}
114 Set interval reasoning allows us to apply consistency techniques such as Bounded
/barrelfish-2018-10-04/doc/009-notifications/
H A DNotify.tex127 a receiver is known to be polling, but which also allow us to control
/barrelfish-2018-10-04/usr/skb/testapps/
H A Dapps.c2468 static JPAKE_CTX *jpake_init(const char *us, const char *them, argument
2486 ctx = JPAKE_CTX_new(us, them, p, g, q, bnsecret);
/barrelfish-2018-10-04/usr/drivers/solarflair/sfxge/common/
H A Defx.h1467 __in unsigned int us);
/barrelfish-2018-10-04/doc/017-arm/
H A DARM.tex158 please let us know if you find a more recent version that works well.
298 TTBR1 for virtual address above 2GB. This saves us the explicit
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex640 Let us start by mapping the conceptual model for the map colouring
699 Let us now take a more interesting problem, which has been set as a
1659 Let us take, as an ongoing example, the constraint that two tasks sharing a
1707 Indeed \ECL allows us to express disjunction as alternative clauses
2026 As a simple example let us make a constraint that two variable differ
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex62 constraints. Let us first recall what we are talking about.
477 Let us try to employ a {\bf problem-specific heuristic}:
1138 As a simple example of local search, let us look at a random walk
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Dknowbase-sec.tex335 For example let us assume the following clauses exist in the knowledge
/barrelfish-2018-10-04/usr/eclipseclp/documents/mpslib/
H A Doutline.tex74 programming is however quite complex and error prone. This motivated us to make

Completed in 248 milliseconds

123