Sciweavers

116 search results - page 5 / 24
» Learning Implied Global Constraints
Sort
View
CPAIOR
2009
Springer
14 years 1 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
CSL
2007
Springer
14 years 1 months ago
Qualitative Temporal and Spatial Reasoning Revisited
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
Manuel Bodirsky, Hubie Chen
ICML
2009
IEEE
14 years 8 months ago
Multi-class image segmentation using conditional random fields and global classification
A key aspect of semantic image segmentation is to integrate local and global features for the prediction of local segment labels. We present an approach to multi-class segmentatio...
Nils Plath, Marc Toussaint, Shinichi Nakajima
AAAI
2000
13 years 8 months ago
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
Phokion G. Kolaitis, Moshe Y. Vardi
CP
1995
Springer
13 years 11 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo