10715 search results - page 1758 / 2143 » Proofs from Tests |
164
click to vote
AAAI
2000
15 years 9 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...
201
click to vote
AAAI
1998
15 years 9 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
228
click to vote
AAAI
1998
15 years 9 months ago
1998
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
186
click to vote
ACL
1998
15 years 9 months ago
1998
The study presented here relies on the integrated use of different kinds of knowledge in order to improve first-guess accuracy in non-word context-sensitive correction for general...
179
click to vote
ACL
2000
15 years 9 months ago
2000
This paper presents a corpus-based algorithm capable of inducing inflectional morphological analyses of both regular and highly irregular forms (such as broughtbring) from distrib...