[PDF] Top 20 PRL RR 11 pdf

... This leads to an essential difference between query languages over first-order terms such as PROLOG and LIFE, a query language over OSF-terms: In the first case, an answer of a query sta[r] ... See full document

... In order to speed-up the Monte Carlo simulation of conditional probabilities, we developed an original variance reduction technique called Quadratic Resampling. Quadratic Resampling was originally presented in Barraquand ... See full document

... An important structural property of many logic programming systems is the fact that they factorize into a constraint system and a relational facility. Colmerauer’s Prolog II [10] is an early language design making ... See full document

... The path planning problem, i.e., the geometrical problem of finding a collision-free path between two given configurations of a robot moving among obstacles, has been much studied in recent years (Latombe 1990 [24]). ... See full document

... why they cannot make the desired connection. In order to resolve ambiguous snaps, the user can reject a snap by pushing a button, which causes the site to be deactivated. This is somewhat similar to our approach, except ... See full document

... Le pas de calcul ∆ est d´etermin´e par le composant le plus lent (chemin critique) de l’ensemble du syst`eme synchrone (11). Notre objectif est de r´egler ∆ sur la vitesse nominale des m´emoires. Nous montrons en ... See full document

... The experiments with RPP have shown that randomized planning is both efficient and reliable. The efficiency of RPP results from the fact that a typical path planning problem has many solutions, so that a globally random ... See full document

... Qualified segment Q is stored in the database, so we do not know its actual contents, hence we cannot compute Q[g] by simply unifying all facts in Q with the goal. So, we need another technique to compute Q[g], ... See full document

... versit´e de Moncton (Canada) [36, 136, 137]. BinProlog has two key ideas: transforming clauses to binary clauses and passing success continuations. The resulting instruction set is essentially a simplified subset of the ... See full document

... 0000010110 11 6 6 10001001011 12 6 8 111001100101 13 6 6 1000000101001 14 6 8 11100100010000 15 8 8 000100110101111 16 8 10 1101110000011010 17 8 10 11001101101010001 18 8 10 110010110010000101 19 10 10 ... See full document

... : 11 OrDigits(n,d), :::::::::::::::::: 15 SetDigit(n,d), :::::::::::::::::: 16 SetToZero(n,nl), :::::::::::::::: 16 ShiftLeft(m,ml,nbits), :::::::::::: 9 ShiftRight(m,ml,nbits), :::::::::: 11 ... See full document

... It should be pointed out that the five Pab structures mentioned so far do not exactly have the same computing power: while it only takes one of either [X91] programmable active bit to implement a serial adder, it takes ... See full document

... Then, we have described a new numerical technique called the Forward Shooting Grid method FSG for pricing both European and American non-holonomic contingent claims, and have tested it o[r] ... See full document

... The Owicki-Gries method, an extension to concurrent programs of Floyd’s method [3] for proving partial correctness of sequential programs, was developed independently by Owicki and Gries [11] and by us [8]. These ... See full document

... We used the packet rates obtained from the bridge and router interface statistics to annotate a network map and give a graphical interpretation of the traffic intensity throughout the St[r] ... See full document

... The function Tp takes a typing environment a function from term variables to types and a selective -term M, and returns a pair h'; i where ' is a set of type equations in solved form i.[r] ... See full document

... of shared, mutable les. This traditional model of le system semantics is easy for clients to understand, but an ecient distributed implementation is quite complex. The simplest implementations, such as the Newcastle ... See full document

... 6.2.1 Application to standard path planning problems Initially, this penalty function approach was developed in Barraquand and Ferbach 1993 [2] as a variant of the VDP method for solving[r] ... See full document

... Thus, the minimum sequence of memory accesses in the absence of contention that a mutual exclusion algorithm must perform is: w-x, r-y, w-y, r-x, critical section, w-y.. This is the sequ[r] ... See full document

... normalization strategy consisting of repeatedly normalizing a term first with the terminating rules, and then apply, if at all necessary, the tenth rule; and 2 it provides a compilation [r] ... See full document