71228 search results - page 14071 / 14246 » Algorithms |
151
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
Wereporthere ona studyof interannotatoragreementin the coreferencetask as defined by the MessageUnderstanding Conference(MUC-6and MUC-7).Basedon feedback from annotators, weclarif...
165
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
161
click to vote
ECCC
1998
15 years 6 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
161
click to vote
EXPERT
1998
15 years 6 months ago
1998
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
167
click to vote
JAL
2002
15 years 6 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...