1381 search results - page 67 / 277 » Computational Complexity of Constraint Satisfaction |
219
click to vote
AI
2012
Springer
14 years 2 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
172
Voted
KBSE
2006
IEEE
16 years 22 days ago
2006
IEEE
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
167
click to vote
CCIA
2005
Springer
16 years 7 days ago
2005
Springer
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
180
Voted
ISAAC
2007
Springer
16 years 26 days ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
158
Voted
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...