1483 search results - page 17 / 297 » Geometric constraint satisfaction using optimization methods |
AI
2006
Springer
13 years 11 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
ECAI
2008
Springer
14 years 21 days ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ISCAS
2006
IEEE
14 years 5 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
CONSTRAINTS
2010
13 years 11 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...