Results 1  10
of
55,442
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
text of concurrency because of the use of constraints for communication and control, and in the context of AI because of the availability of simple yet powerful mechanisms for controlling inference, and the promise that very rich representational/programming languages, sharing the same set of abstract properties, may
The nesC language: A holistic approach to networked embedded systems
 In Proceedings of Programming Language Design and Implementation (PLDI
, 2003
"... We present nesC, a programming language for networked embedded systems that represent a new design space for application developers. An example of a networked embedded system is a sensor network, which consists of (potentially) thousands of tiny, lowpower “motes, ” each of which execute concurrent, ..."
Abstract

Cited by 943 (48 self)
 Add to MetaCart
, reactive programs that must operate with severe memory and power constraints. nesC’s contribution is to support the special needs of this domain by exposing a programming model that incorporates eventdriven execution, a flexible concurrency model, and componentoriented application design. Restrictions
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a
A Subexponential Bound for Linear Programming
 ALGORITHMICA
, 1996
"... We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected min{O(d 2 2 d n),e 2 d ln(n / d)+O ( d+ln n)} time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise, the algorith ..."
Abstract

Cited by 185 (15 self)
 Add to MetaCart
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected min{O(d 2 2 d n),e 2 d ln(n / d)+O ( d+ln n)} time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise
Foundations of Timed Concurrent Constraint Programming
 Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science
, 1994
"... We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denota ..."
Abstract

Cited by 103 (10 self)
 Add to MetaCart
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical
Soft Concurrent Constraint Programming
, 2001
"... . Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving algorithms, even distributed ones, by now there seems to be no concurrent programming fram ..."
Abstract

Cited by 59 (34 self)
 Add to MetaCart
. Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving algorithms, even distributed ones, by now there seems to be no concurrent programming
Analysis of Inheritance Anomaly in ObjectOriented Concurrent Programming Languages
, 1993
"... It has been pointed out that inheritance and synchronization constraints in concurrent object systems often conflict with each other, resulting in inheritance anomaly where redefinitions of inherited methods are necessary in order to maintain the integrity of concurrent objects. The anomaly is seri ..."
Abstract

Cited by 180 (2 self)
 Add to MetaCart
It has been pointed out that inheritance and synchronization constraints in concurrent object systems often conflict with each other, resulting in inheritance anomaly where redefinitions of inherited methods are necessary in order to maintain the integrity of concurrent objects. The anomaly
Limits of Control Flow on Parallelism
 Proc. 19th Annual International Symposium on Computer Architecture
, 1992
"... This paper discusses three techniques useful in relaxing the constraints imposed by control flow on parallelism: control dependence analysis, executing multiple flows of control simultaneously, and speculative execution. We evaluate these techniques by using trace simulations to find the limits of p ..."
Abstract

Cited by 255 (2 self)
 Add to MetaCart
This paper discusses three techniques useful in relaxing the constraints imposed by control flow on parallelism: control dependence analysis, executing multiple flows of control simultaneously, and speculative execution. We evaluate these techniques by using trace simulations to find the limits
Concurrency and Concurrent Constraint Programming
 In Proc. ESOP, April 6  14, 2002
, 1995
"... . The intent of this paper is to provide the basic ideas and the possible alternatives underlying the task of giving a semantics to a concurrent system/language, and to describe a particular approach which makes some specific choices in order to give a semantics to the class of CC languages. In part ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. In particular, we will discuss how to handle the issues of concurrency and nondeterminism, and we will examine in detail the formalism of Petri nets, which, suitably extended, we will then use for CC languages. In our semantics for CC programs, the meaning of a program is in fact a net where the concurrency
Stochastic concurrent constraint programming
 In Proceedings of 4th International Workshop on Quantitative Aspects of Programming Languages, QAPL 2006, ENTCS
, 2006
"... We tackle the problem of relating models of systems (mainly biological systems) based on stochastic process algebras (SPA) with models based on differential equations. We define a syntactic procedure that translates programs written in stochastic Concurrent Constraint Programming (sCCP) into a set o ..."
Abstract

Cited by 44 (14 self)
 Add to MetaCart
We tackle the problem of relating models of systems (mainly biological systems) based on stochastic process algebras (SPA) with models based on differential equations. We define a syntactic procedure that translates programs written in stochastic Concurrent Constraint Programming (sCCP) into a set
Results 1  10
of
55,442