98 search results - page 1 / 20 » Optimizing Ada on the fly |
SIGADA
1999
Springer
15 years 1 months ago
1999
Springer
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
67
Voted
ICFEM
2009
Springer
14 years 7 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
AMFG
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper proposes the AdaBoost Gabor Fisher Classifier (AGFC) for robust face recognition, in which a chain AdaBoost learning method based on Bootstrap re-sampling is proposed an...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....