1381 search results - page 43 / 277 » Computational Complexity of Constraint Satisfaction |
143
click to vote
AI
2003
Springer
15 years 9 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
163
click to vote
CSMR
1998
IEEE
15 years 8 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
133
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...