2657 search results - page 76 / 532 » On the complexity of hierarchical problem solving |
131
click to vote
CI
2011
14 years 8 months ago
2011
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
131
click to vote
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
109
click to vote
GECCO
2004
Springer
15 years 6 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...
146
click to vote
MOBICOM
2006
ACM
15 years 7 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
111
click to vote
SARA
2007
Springer
15 years 7 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...