Results 1  10
of
200,299
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
 Machine Learning
, 1998
"... . This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract

Cited by 487 (47 self)
 Add to MetaCart
. This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from data, alog with the most likely path taken by the robot. Experimental results in cyclic environments of size up to 80 by 25 meter illustrate the appropriateness of the approach. Keywords: Bayes rule, expectation maximization, mobile robots, navigation, localization, mapping, maximum likelihood estimation, positioning, probabilistic reasoning 1. Introduction Over the last two decades or so, the problem of acquiring maps in indoor environments has received considerable attention in the mobile robotics community. The problem of map building is the problem of determining the location of entitiesofinterest (such as: landmarks, obstacles), often relative to a global frame of reference (such as ...
An Object Calculus for Asynchronous Communication
 Proceedings of the European Conference on ObjectOriented Programming (ECOOP
, 1991
"... This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ßcalculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally this resu ..."
Abstract

Cited by 392 (34 self)
 Add to MetaCart
This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ßcalculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract

Cited by 621 (72 self)
 Add to MetaCart
for applications in high level control of robots and industrial processes, intelligent software agents, discrete event simulation, etc. It is based on a formal theory of action specified in an extended version of the situation calculus. A prototype implementation in Prolog has been developed.
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
, 2003
"... In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, ..."
Abstract

Cited by 601 (41 self)
 Add to MetaCart
the development of a modelling language capable of expressing temporal and numeric properties of planning domains. In this paper we describe the language, PDDL2.1, that was used in the competition. We describe the syntax of the language, its formal semantics and the validation of concurrent plans. We observe
Guarded Commands, Nondeterminacy and Formal Derivation of Programs
, 1975
"... Socalled "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract

Cited by 521 (0 self)
 Add to MetaCart
. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown.
UNet: A UserLevel Network Interface for Parallel and Distributed Computing
 In Fifteenth ACM Symposium on Operating System Principles
, 1995
"... The UNet communication architecture provides processes with a virtual view of a network interface to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from the communi ..."
Abstract

Cited by 596 (17 self)
 Add to MetaCart
performance equivalent to Meiko CS2 and TMC CM5 supercomputers on a set of SplitC benchmarks. 1
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
 IEEE TRANSACTIONS ON COMPUTERS
, 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract

Cited by 592 (37 self)
 Add to MetaCart
Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake
Results 1  10
of
200,299