285 search results - page 29 / 57 » The complexity of soft constraint satisfaction |
129
click to vote
CP
2007
Springer
15 years 6 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...
102
click to vote
IJCAI
2003
15 years 1 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
101
click to vote
AGENTS
2001
Springer
15 years 4 months ago
2001
Springer
Real-time control has become increasingly important as technologies are moved from the lab into real world situations. The complexity associated with these systems increases as co...
AAAI
2004
15 years 1 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
148
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...