7253 search results - page 1146 / 1451 » Agile Performance Testing |
113
click to vote
AAAI
2000
15 years 5 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...
115
click to vote
AAAI
1998
15 years 5 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...
148
click to vote
AAAI
2000
15 years 5 months ago
2000
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...
123
click to vote
AAAI
1998
15 years 5 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...
136
click to vote
AAAI
1998
15 years 5 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...