62 search results - page 11 / 13 » Event-Driven Probabilistic Constraint Programming |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
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...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
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...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
SAT
2004
Springer
14 years 29 days ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
SIAMSC
2010
13 years 6 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...