8496 search results - page 122 / 1700 » Problem Solving and Complex Systems |
169
Voted
FOCS
1998
IEEE
15 years 9 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...
136
click to vote
GECCO
2004
Springer
15 years 10 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...
185
click to vote
MOBICOM
2006
ACM
15 years 11 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...
144
Voted
SARA
2007
Springer
15 years 11 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...
131
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...