1039 search results - page 15 / 208 » Query reformulation with constraints |
LRE
2006
13 years 7 months ago
2006
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
IJCAI
2007
13 years 8 months ago
2007
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest i...
CIA
2000
Springer
13 years 11 months ago
2000
Springer
The research reported in this paper has both a scientific and a commercial aim. The scientific interest is to explore the use of contexts in order to improve the quality of informa...
CP
1999
Springer
13 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...