Searching for authors named "Nicos Angelopoulos" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

Prolog issues of an MCMC algorithm
by Nicos Angelopoulos James, James Cussens — 2001 — In Proceedings of the 14th International Conference of Applications of Prolog INAP2001
…We present a Markov chain Mode Carlo algorithm that operates on generic model structures that are represented by terms found in the computed answers produced by stochastic logic programs. The objective of this paper is threefold (a) to show that SLD-trees are an elegant means for describing prior…
Add To MetaCart

Computer Science Technical Report No. 1998/02
by Randomised Algorithms, Nicos Angelopoulos, Nicos Angelopoulos, Ra Di Pierro, Ra Di Pierro, Herbert Wiklicky — 1998 — In JICSLP'98 { Joint International Conference and Symposium on Logic Programming
…We propose a declarative-based implementation of randomised algorithms, which exploits the Constraint Logic Programming (CLP) paradigm. For the high-level formalisation of probabilistic programs expressing such algorithms we actually refer to a generalisation of CLP, namely the Probabilistic Concurr…
Add To MetaCart

Implementing Randomised Algorithms in Constraint Logic Programming
by Nicos Angelopoulos Alessandra, Ra Di Pierro, Herbert Wiklicky — 1998 — In JICSLP'98 { Joint International Conference and Symposium on Logic Programming
…We propose a declarative-based implementation of randomised algorithms, which exploits the Constraint Logic Programming (CLP) paradigm. For the high-level formalisation of probabilistic programs expressing such algorithms we actually refer to a generalisation of CLP, namely the Probabilistic Concurr…
Add To MetaCart

Randomised Algorithms and Constraint Logic Programming
by Nicos Angelopoulos, Alessandra Di Pierro, Nicos Angelopoulos, Ra Di Pierro, Ra Di Pierro, Herbert Wiklicky — 1998 — In JICSLP'98 { Joint International Conference and Symposium on Logic Programming
…We propose a declarative-based implementation of randomised algorithms, which exploits the Constraint Logic Programming (CLP) paradigm. For the high-level formalisation of probabilistic programs expressing such algorithms we actually refer to a generalisation of CLP, namely the Probabilistic Concurr…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 4.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB