1381 search results - page 127 / 277 » Computational Complexity of Constraint Satisfaction |
132
click to vote
AIPS
2010
15 years 6 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
125
click to vote
DAIS
2010
15 years 5 months ago
2010
Abstract. More and more home devices are equipped with advanced computational capabilities to improve the user satisfaction (e.g., programmable heating system, Internet TV). Althou...
148
click to vote
MOZ
2004
Springer
15 years 9 months ago
2004
Springer
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
109
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
121
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...