4117 search results - page 166 / 824 » On the Satisfiability of Complex Constraints |
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
134
click to vote
MOR
2008
15 years 6 months ago
2008
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
181
click to vote
ECML
2005
Springer
16 years 1 days ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
167
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
143
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...