Using PVS to validate the algorithms of an exact arithmetic.
David R. LesterPaul GowlandPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- orders of magnitude
- real world
- learning algorithm
- computational complexity
- significant improvement
- computationally efficient
- times faster
- computationally expensive
- benchmark datasets
- theoretical analysis
- optimization problems
- computational cost
- worst case
- machine learning algorithms
- upper bound
- data mining algorithms
- machine learning
- neural network