405 search results - page 49 / 81 » On the Complexity of Global Constraint Satisfaction |
SI3D
2003
ACM
15 years 4 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
103
click to vote
ISAAC
2007
Springer
15 years 5 months 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...
KBSE
2006
IEEE
15 years 5 months 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...
GECCO
2004
Springer
15 years 4 months 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...
84
Voted
PKDD
2004
Springer
15 years 4 months ago
2004
Springer
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...