10602 search results - page 409 / 2121 » Weakly Useful Sequences |
223
click to vote
VL
1991
IEEE
15 years 11 months ago
1991
IEEE
The Conceptual Programming environment, CP, being developed at the Computing Research Laboratory (CRL), is a complete knowledge representation visual programming environment for u...
211
click to vote
IIS
2004
15 years 9 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we present t...
215
click to vote
IJCAI
2003
15 years 9 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...
219
click to vote
IJCAI
1993
15 years 9 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...
181
click to vote
COGSCI
2002
15 years 7 months ago
2002
Selectional preferences have a long history in both generative and computational linguistics. However, since the publication of Resnik's dissertation in 1993, a new approach ...