837 search results - page 37 / 168 » Hard combinators |
ECIR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The following paper proposes a new kind of relevance feedback. It shows how so called query profiles can be employed for disambiguation and clarification. Query profiles ...
108
click to vote
IJCAI
2003
15 years 1 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
122
click to vote
UAI
1998
15 years 1 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
AAAI
1994
15 years 1 months ago
1994
This paper presents a novel approach to diagnosis which addresses the two problems - computational complexity of abduction and device models - that have prevented model-based diag...
109
click to vote
IJCAI
1993
15 years 1 months ago
1993
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...