4218 search results - page 663 / 844 » Complete sets of cooperations |
AAAI
2000
13 years 10 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
AAAI
1998
13 years 10 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
AAAI
2000
13 years 10 months ago
2000
The SharedPlans formalization of collaboration (Grosz and Kraus 1999) stipulates that collaborating agents must commit to certain decision-making processes, but it does not specif...
AAAI
2000
13 years 10 months ago
2000
Most CBR systems rely on a fixed library of cases, where each case consists of a set of facts specified in advance. This paper describes techniques for dynamically extracting case...
ACL
1998
13 years 10 months ago
1998
The probabilistic relation between verbs and their arguments plays an important role in modern statistical parsers and supertaggers, and in psychological theories of language proc...