1381 search results - page 48 / 277 » Computational Complexity of Constraint Satisfaction |
149
Voted
EDOC
2007
IEEE
15 years 7 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
132
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
106
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
176
Voted
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
102
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...