Results 1 - 10 of 19

On Probabilistic CCP

by Alessandra Di Pierro, Herbert Wiklicky - IN PROCEEDINGS OF APPIA-GULP-PRODE'97 JOINT CONFERENCE ON DECLARATIVE PROGRAMMING , 1997
"... This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called "randomised algorithms" within the CCP framework. Our approach incorporates randomness directly within the (operational) s ..."
Abstract - Cited by 10 (5 self) - Add to MetaCart
This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called "randomised algorithms" within the CCP framework. Our approach incorporates randomness directly within the (operational

A distriuted and probabilistic concurrent constraint programming language

by Luca Bortolussi, Herbert Wiklicky , 2005
"... Abstract. We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and independent constraint store. While locally the computations evolve asynchronously, following the usual rules of (pr ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and independent constraint store. While locally the computations evolve asynchronously, following the usual rules

Probabilistic Concurrent Constraint Programming

by Vineet Gupta, Radha Jagadeesan, Vijay Saraswat - In Proceedings of CONCUR 97 , 1997
"... . We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators for default reasoning. We extend pcc uniformly over time, to get a synchronous reactive probabilistic programming language, Time ..."
Abstract - Cited by 22 (0 self) - Add to MetaCart
. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators for default reasoning. We extend pcc uniformly over time, to get a synchronous reactive probabilistic programming language

Integrated coverage and connectivity configuration for energy conservation in sensor networks

by Guoliang Xing, Xiaorui Wang, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill - ACM Transactions on Sensor Networks , 2005
"... An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and ..."
Abstract - Cited by 132 (11 self) - Add to MetaCart
: this is in sharp contrast to several existing approaches that address the two problems in isolation. 3) We integrate CCP with SPAN to provide both coverage and connectivity guarantees. 4) We propose a probabilistic coverage model and extend CCP to provide probabilistic coverage guarantees. We demonstrate

An Operational Semantics for Probabilistic Concurrent Constraint Programming

by Alessandra Di Pierro, Herbert Wiklicky , 1998
"... This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called "randomised algorithms" within the CCP framework. Differently from common approaches in (imperative) high-level programmin ..."
Abstract - Cited by 32 (12 self) - Add to MetaCart
This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called "randomised algorithms" within the CCP framework. Differently from common approaches in (imperative) high

Probabilistic Constraint Handling Rules

by unknown authors
"... Abstract Classical Constraint Handling Rules (CHR) provide a powerful tool for specifying and implementing constraint solvers and programs. The rules of CHR rewrite constraints (non-deterministically) into simpler ones until they are solved. In this paper we introduce an extension of Constraint Hand ..."
Abstract - Add to MetaCart
Handling Rules (CHR), namely Probabilistic CHRs (PCHR). These allow the probabilistic "weighting " of rules, specifying the probability of their application. In this way we are able to formalise various randomised algorithms such as for example Simulated Annealing. The implementation

A Markov Model for Probabilistic Concurrent Constraint Programming

by Alessandra Di Pierro, Herbert Wiklicky - IN TO APPEAR IN PROCEEDINGS OF APPIA-GULPPRODE '98, JOINT CONFERENCE ON DECLARATIVE PROGRAMMING , 1998
"... This paper introduces a new approach towards the semantics of Concurrent Constraint Programming (CCP), which is based on operator algebras. In particular, we show how stochastic matrices can be used for modelling both a quantitative version of nondeterminism (in the form of a probabilistic choice) a ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
This paper introduces a new approach towards the semantics of Concurrent Constraint Programming (CCP), which is based on operator algebras. In particular, we show how stochastic matrices can be used for modelling both a quantitative version of nondeterminism (in the form of a probabilistic choice

A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming

by Alessandra di Pierro, Herbert Wiklicky - IN CATS'98 -- COMPUTING: THE 4TH AUSTRALIAN THEORY SYMPOSIUM, LECTURE NOTES IN COMPUTER SCIENCE , 1998
"... The aim of this work is to provide a probabilistic foundation for nondeterministic computations in Concurrent Constraint Programming (CCP). Differently from common approaches in (imperative) high-level programming languages, which rely on some kind of random() function, we introduce randomness in th ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
The aim of this work is to provide a probabilistic foundation for nondeterministic computations in Concurrent Constraint Programming (CCP). Differently from common approaches in (imperative) high-level programming languages, which rely on some kind of random() function, we introduce randomness

Poster Presentation: Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing

by Matthieu Petit, Arnaud Gotlieb
"... Probabilistic Concurrent Constraint Programming (PCCP) [3] is an exten-sion of Concurrent Constraint Programming (CCP) [5] where probabilistic choice operators are introduced to represent the randomness or uncertain behaviour of processes. A probabilistic choice between two processes can be though o ..."
Abstract - Add to MetaCart
Probabilistic Concurrent Constraint Programming (PCCP) [3] is an exten-sion of Concurrent Constraint Programming (CCP) [5] where probabilistic choice operators are introduced to represent the randomness or uncertain behaviour of processes. A probabilistic choice between two processes can be though

Loss reduction in distribution networks using concurrent constraint programming” Probabilistic Methods Applied to Power Systems

by N G Caicedo , Member, IEEE, Díaz C A Lozano , J F Rueda , C Gutiérrez , G Olarte , C , 2004
"... Abstract-This paper presents a new technical losses reduction model in an electrical energy distribution system by using network reconfiguration technique. First-order logic is used as the model specification language. This specification is easily translated into programmable sentences in the CCP ( ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract-This paper presents a new technical losses reduction model in an electrical energy distribution system by using network reconfiguration technique. First-order logic is used as the model specification language. This specification is easily translated into programmable sentences in the CCP
Results 1 - 10 of 19