Sciweavers

239 search results - page 38 / 48
» Probabilistic Concurrent Constraint Programming
Sort
View
ENTCS
2002
113views more  ENTCS 2002»
13 years 7 months ago
An Operational Semantics for Declarative Multi-Paradigm Languages
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
ICRA
2006
IEEE
149views Robotics» more  ICRA 2006»
14 years 1 months ago
On Learning the Statistical Representation of a Task and Generalizing it to Various Contexts
— This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
Sylvain Calinon, Florent Guenter, Aude Billard
CP
2005
Springer
14 years 1 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
PODC
2009
ACM
14 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young