Sciweavers

239 search results - page 25 / 48
» Probabilistic Concurrent Constraint Programming
Sort
View
ESOP
2009
Springer
14 years 4 months ago
Conversation Types
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...
Luís Caires, Hugo Torres Vieira
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
14 years 2 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
CP
2004
Springer
14 years 3 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
CP
2005
Springer
14 years 3 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen
JMLR
2012
12 years 10 days ago
Markov Logic Mixtures of Gaussian Processes: Towards Machines Reading Regression Data
We propose a novel mixtures of Gaussian processes model in which the gating function is interconnected with a probabilistic logical model, in our case Markov logic networks. In th...
Martin Schiegg, Marion Neumann, Kristian Kersting