73 search results - page 9 / 15 » Constraint Satisfaction Methods for Information Personalizat... |
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
135
click to vote
CIMCA
2006
IEEE
15 years 5 months ago
2006
IEEE
Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasi...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
SIGIR
2005
ACM
15 years 5 months ago
2005
ACM
We present a model, based on the maximum entropy method, for analyzing various measures of retrieval performance such as average precision, R-precision, and precision-at-cutoffs....
101
click to vote
LATIN
2010
Springer
14 years 10 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...