1968 search results - page 106 / 394 » The Complexity of Valued Constraint Models |
105
click to vote
KBS
2007
15 years 1 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
114
click to vote
AAAI
2007
15 years 3 months ago
2007
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
102
Voted
ENDM
2000
15 years 1 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
120
click to vote
ER
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relatio...
104
click to vote
SIGECOM
2006
ACM
15 years 7 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...