Studying informational sensitivity of computer algorithm solving TSP

Kiktenko, A. A.; Nikiforov, Konstantin

doi:10.1109/icctpea.2014.6893286

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Other1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More practically-oriented approach is measuring complexity in terms of time of execution of given algorithm on given computing system [1], [2], [3]. This approach is less general, but it has that advantage that it allows to test the computation speed of whole software complex and derive properties of the algorithm it's based on without having to study employed third-party libraries, packages and mathematical environments separately.…”

Section: Introductionmentioning

confidence: 99%

Confidence complexity of computer algorithms

Kiktenko

Lunkovskiy

Nikiforov

2014

2014 2nd 2014 2nd International Conference on Emission Electronics (ICEE)

Self Cite

View full text Add to dashboard Cite

A statistical research of an algorithm complexity as a random value was carried out via numerical experimentation using parallel computation. For a segment of input data sizes point characteristics for this random value and its confidence interval are obtained. Confidence complexity function value based on gamma-distribution is determined. The following result have been obtained: the used criteria are adequate for predicting the mean execution time and its confidence intervals for given input types.

show abstract

Section: Introductionmentioning

confidence: 99%