[PDF] Top 20 PRL RR 25 pdf

... [B92] G. Berry. A Hardware Implementation of Pure Esterel. Academy Proceedings in Engineering Sciences, Indian Academy of Sciences, Sadhana, 17:1:95–130, 1992. Also available as PRL Research Report 15, Digital ... See full document

... Yet, as Noyce observed, the complex combined cumulative effect of all these punctual and discrete advances is as if, the feature size of our circuit manufacturing technology was simply shrinking linearly with time. As ... See full document

... One origin of FT is A¨ıt-Kaci’s -term calculus [1], which is at the heart of the programming language LOGIN [3] and further extended in the language LIFE [5] with functions over feature structures thanks to a ... See full document

... PAM technology, introduced by J. Vuillemin [1], is based on a matrix of programmable active bits. It permits the realization, through a downloadable bitstream, of synchronous logic circuits comprising combinatorial logic ... See full document

... Early attempts at improving computer-based illustrators suggested the use of constraints to maintain relationships between graphical objects in illustrations. Though the use of constraints in drawing programs [13, 22, ... See full document

... Une implantation de la m´ethode, sur technologie PAM (m´emoire active programmable [BRV 89], [BRV 92]), utilise un pipe-line de 128 op´erateurs 24 bits, avec une fr´equence d’horloge de 20 MHz. Ceci permet de calculer 5 ... See full document

... The local-minima problem can be addressed at two levels: (1) in the definition of the potential function, by attempting to specify a function with no or few local minima; and (2) in the design of the search algorithm, by ... See full document

... method of quadratic resampling yields an error reduction factor ranging from 2 for problems with low correlation to several hundreds for problems with high correlation. Indeed, the cash-flow function is closer to its ... See full document

... The host writes the A, B and S operands into the PAM, and reads back the resulting P. The speed-up factor achieved by this hardware co-processor can be greater than 25 for long operands, compared to carefully ... See full document

... 100011110110110000010101 25 12 14 1011000110000000101110100 26 12 14 10010100111110001000100010 27 12 14 110100010111001100000000010 28 14 16 0111001111110100100110101000 29 14 16 00000101100111111001010011101 30 ... 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

... 7 This is the standard rule if the standard order-normal form of M starts with an abstraction, or an application greater or equal to m.. Else they would have to switch anyway.[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

... Given an environment containing a robot, stationary obstacles, and movable bodies, the manipulation problem consists in finding a sequence of free robot motions, grasping and ungrasping [r] ... See full document

... A boolean safe register can fail to be regular only if a read that overlaps a write that does not change the value returns the other value|for example, writing the value true when the cu[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

... 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

... 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

... Case 4: attach is TRUE, toName is local and fromName is remote | Like case 2 except that instead of an actual transfer of contents and properties the local name is attached to the remote[r] ... See full document

... Then, from polygonal approximations of the fitted trajectory and the brush outline, both obtained through de Casteljau subdivision, a polygonal approximation of the left and right border[r] ... See full document