Sciweavers

607 search results - page 4 / 122
» A Framework for Dynamic Constraint Reasoning using Procedura...
Sort
View
ECSQARU
2009
Springer
14 years 10 days ago
Merging Qualitative Constraints Networks Using Propositional Logic
In this paper we address the problem of merging qualitative constraints networks (QCNs). We propose a rational merging procedure for QCNs. It is based on translations of QCNs into ...
Jean-François Condotta, Souhila Kaci, Pierr...
CPAIOR
2010
Springer
13 years 10 months ago
Constraint Reasoning with Uncertain Data Using CDF-Intervals
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
Aya Saad, Carmen Gervet, Slim Abdennadher
ECCV
2008
Springer
14 years 7 months ago
Multiple Tree Models for Occlusion and Spatial Constraints in Human Pose Estimation
Abstract. Tree-structured models have been widely used for human pose estimation, in either 2D or 3D. While such models allow efficient learning and inference, they fail to capture...
Greg Mori, Yang Wang 0003
SAC
2002
ACM
13 years 5 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 5 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm