717 search results - page 80 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
CP
2004
Springer
15 years 1 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
CONSTRAINTS
2010
14 years 10 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
JAIR
2008
14 years 10 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...