R. J. Williams. Reinforcement-learning connectionist systems. Technical Report NU-CCS-87-3, College of Computer Science, Northeastern University, Boston, 1987. This article was processed using the LTEX macro package with LLNCS style  Home/Search   Document Not in Database   Summary   Related Articles   Check

....functions in artificial intelligence [10] adaptive control [11] and reinforcement learning have been discovered [3, 27, 31] This has caused a rapidly growing interest in this field . Although a multitude of algorithms and architectures is available that implement reinforcement learning [21, 29, 34], we only consider reinforcement learning systems that deal with delayed reinforcement [5, 21, 28] In addition, all these systems share a central mechanism that allows a computational agent to evaluate situations with respect to a prediction of the accu mulated future reinforcement. Minsky [15] ....

R. J. Williams. Reinforcement-learning connectionist systems. Technical Report NU-CCS-87-3, College of Computer Science, Northeastern University, Boston, 1987. This article was processed using the LTEX macro package with LLNCS style

....section. It is well known that sentences like (12) Mary revised her paper before Susan did are systematically ambiguous between a strict reading in which both Mary and Susan revised Mary s paper, and a sloppy reading in which each revised her own paper [7] Most treatments of this phenomenon [9, 28, 34], rely on an identity of relations analysis of ellipsis, in which the interpretation of the elided material in the target clause ( Susan did in the example) must be identical to the interpretation of a suitable phrase in the source clause ( Mary revised her paper in the example) Sag s analysis ....

E. Williams. Discourse and logical form. Linguistic Inquiry, 8(1):101--139, 1977. This article was processed using the L A T E X macro package with ICM style

....on Mars, Europa and elsewhere in the solar system and beyond will require the solution of several challenging technical and organizational problems. A central one is the implementation of increasingly capable and autonomous control systems to ensure both mission accomplishment and mission safety [17, 6, 15]. Without these systems missions will have to be run with the current, traditional approach. This relies on frequent communication with Earth and teams of human experts guiding step by step a mission through its tasks and analyzing and reacting to the occurrence of malfunctions. The cost and ....

....tools. Conclusions appear in Section 5. 2 The Remote Agent and Planner Architectures The RA architecture consists of four distinct components (Figure 1) the Planner Scheduler, the Mission Manager [11] the Smart Executive (EXEC) 14] and the Mode Identification and Recovery (MIR) system [16, 17] . The execution of plans by the EXEC is achieved by interaction with a Mode Identification system and a lower level real time monitoring and control component. MIR provides the EXEC with a level of abstraction to reason about the Plan Experts Planner Scheduler Mission Manager Smart Executive ....

Brian C. Williams and P. Pandurang Nayak. Immobile Robots, AI in the New Millennium. AI Magazine, Fall, 1996. This article was processed using the L A T E X macro package with LLNCS style

....best first B B In serial implementation, PQs are usually represented by heaps. There exist a great variety of algorithms which manage a heap : D heap [30] leftist heap [30] Skew heap [61] Binomial queue [4] Pairing heap [24, 60] The most popular one is the D heap 1 as used in the heapsort ([64]) This is the oldest PQ implementation with O(log d (n) performance for basic operations. In a heap, the priority structure is represented as a binary tree that obeys the heap invariant, which states that each item always has a higher priority than its children. In a D heap, the tree is embedded ....

J. Williams. Algorithm 232: Heapsort. CACM, 7:347--348, 1964. This article was processed using the L a T E X macro package with LLNCS style

....of Q and returns the element. Delete(Q; e) Deletes element e from priority queue Q provided that it is known where e is stored in Q (priority queues do not support the searching for an element) The implementation of priority queues is a classical problem in data structures. A few references are [14, 13, 8, 7, 5, 6, 10]. This work was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 7141 (project ALCOM II) and by the Danish Natural Science Research Council (Grant No. 9400044) Basic Research in Computer Science, Centre of the Danish National Research ....

J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347--348, 1964. This article was processed using the L a T E X macro package with LLNCS style

....The knowledge of the group order is important in the decryption procedure. A detailed description of all these systems can be found in [6] Author was supported by the Deutsche Forschungsgemeinschaft On the other hand, there exist several RSA variants equivalent to factoring, see for example [10]. We use similar ideas to develop a new public key cryptosystem based on elliptic curves over the ring ZZ=nZZ. For the new cryptosystem, decryption is equivalent to factoring n. Moreover, we discuss a generalization of our ideas to get a public key signature scheme using elliptic curves over ....

....In this section we will describe the new public key cryptosystem based on elliptic curves over ZZ=nZZ. The security of this system is based on the integer factorization problem, as will be shown later. Assume that n is the product of two large primes p; q, where p; q j 11 mod 12. As remarked in [10], each square in (ZZ=nZZ) has exactly four square roots of whom exactly one is itself a square (especially, n is a Blum integer) Moreover, for every element in (ZZ=nZZ) there exists exactly one cube root. We can classify the square roots of a square even further: exactly two square roots ....

[Article contains additional citation context not shown here]

H.C. Williams: A modification of the RSA public-key encryption procedure, IEEE Transactions on Information Theory, IT-26, No. 6, (1980), 726--729 This article was processed using the L A T E X macro package with LLNCS style

....of the priority queues adopt to a processor array of size O(log n) supporting the operations MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time. 1 Introduction The construction of priority queues is a classical topic in data structures. Some references are [1, 2, 6, 7, 8, 9, 19, 20]. A historical overview of implementations can be found in [13] Recently several papers have also considered how to implement priority queues on parallel machines [3, 4, 5, 11, 15, 16, 17, 18] In this paper we focus on how to achieve optimal speedup for the individual priority queue operations ....

J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347--348, 1964. This article was processed using the L a T E X macro package with LLNCS style

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC