1971 search results - page 332 / 395 » Tabu search - Uncharted domains |
149
click to vote
RIAO
2000
15 years 7 months ago
2000
This paper describes work within the NIST Text REtrieval Conference (TREC) over the last three years in designing and implementing evaluations of Spoken Document Retrieval (SDR) t...
162
click to vote
AAAI
1994
15 years 7 months ago
1994
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
158
click to vote
AAAI
1996
15 years 7 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
139
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
152
click to vote
TREC
2007
15 years 7 months ago
2007
For the legal track we used the Wumpus search engine and investigated several methods that have proven successful in other domains, including cover density ranking and Okapi BM25 ...