4451 search results - page 76 / 891 » On Random Ordering Constraints |
CP
2001
Springer
15 years 4 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
154
click to vote
CP
1995
Springer
15 years 3 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
ACL
1992
15 years 1 months ago
1992
Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. S...
165
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...