1381 search results - page 37 / 277 » Computational Complexity of Constraint Satisfaction |
158
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
133
Voted
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
176
Voted
PACT
1999
Springer
15 years 8 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
104
Voted
CHI
2000
ACM
15 years 8 months ago
2000
ACM
Usability comprises the aspects effectiveness, efficiency, and satisfaction. The correlations between these aspects are not well understood for complex tasks. We present data from...
157
Voted
CP
2007
Springer
15 years 10 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...