• No results found

[PDF] Top 20 PRL RR 14 pdf

Has 10000 "PRL RR 14 pdf" found on our website. Below are the top 20 most common "PRL RR 14 pdf".

PRL RR 14 pdf

PRL RR 14 pdf

... This report described a new approach to robot path planning, which essentially consists of: 1 computing potential functions over the robot’s workspace and combining them into a “good” po[r] ... See full document

34

PRL RR 31 pdf

PRL RR 31 pdf

... Many modern programming languages allow specifying arguments of functions and procedures by symbolic keywords as well as using the traditional and natural numeric positions [14, 10, 3]. Symbolic keywords are ... See full document

38

PRL RR 33 pdf

PRL RR 33 pdf

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

38

PRL RR 27 pdf

PRL RR 27 pdf

... The combination of logic programming languages and database systems has been a research theme for the last decade in both logic programming and database communities. The interest from a logic programming perspective came ... See full document

34

PRL RR 1 pdf

PRL RR 1 pdf

... B´ezier curve intersection is studied by Sederberg and Parry [23]. In two of the algorithms they consider, rejection of non-intersecting pieces of two curves is done by bounding box comparison. Forward differencing is ... See full document

30

PRL RR 35 pdf

PRL RR 35 pdf

... Another way to use labels in programming languages has been as keywords for parameter- passing in procedure or function calls. This is the case in Common LISP [21], ADA [15], and LIFE [4]. However, in Common LISP or ADA, ... See full document

38

PRL RR 20 pdf

PRL RR 20 pdf

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

32

PRL RR 19 pdf

PRL RR 19 pdf

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

32

PRL RR 17 pdf

PRL RR 17 pdf

... Purely graphical feedback is problematic, largely because it is not always easily distinguishable from the graphical objects themselves. There is no graphical style attribute, such as line thickness or dash style, ... See full document

30

PRL RR 15 pdf

PRL RR 15 pdf

... Esterel [3, 4, 5, 10] is a synchronous programming language devoted to reactive systems, that is to systems that maintain a continuous interaction with their environment by handling hardware or software events. Its ... See full document

56

PRL RR 6 pdf

PRL RR 6 pdf

... 1000000101001 14 6 8 11100100010000 15 8 8 000100110101111 16 8 10 1101110000011010 17 8 10 11001101101010001 18 8 10 110010110010000101 19 10 10 1001111010100001100 20 10 12 01000011011011000101 21 10 12 ... See full document

36

PRL RR 2 pdf

PRL RR 2 pdf

... 3 In place operations: Bn 5 3.1 Initialization : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.2 Addition : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.3 Subtraction : : ... See full document

37

PRL RR 8 pdf

PRL RR 8 pdf

... In our presentation of background material, we have tried to motivate the introduction of various concepts by showing that they are indispensable to achieve certain natural goals. For pedagogical reasons, it seems that ... See full document

90

PRL RR 37 pdf

PRL RR 37 pdf

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

50

PRL RR 34 pdf

PRL RR 34 pdf

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

36

SRC RR 7 pdf

SRC RR 7 pdf

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

18

SRC RR 6 pdf

SRC RR 6 pdf

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

25

PRL RR 36 pdf

PRL RR 36 pdf

... The WAM mirrors Prolog closely, both in how the program executes and in how the program is compiled: WAM = sequential control call/return/jump instructions + unification get/put/unify in[r] ... See full document

78

Management of advanced gastric cancer: An overview of major findings from meta-analysis

Management of advanced gastric cancer: An overview of major findings from meta-analysis

... The efficacy of targeted therapy was evaluated in three meta-analyses [10, 18, 22]. As for OS, one of them favored targeted therapy of antiangiogenic and HER2 pathway but not for EGFR pathway compared with conventional ... See full document

26

NSL RR 1 pdf

NSL RR 1 pdf

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

122

Show all 10000 documents...