{"title":"计算机算法的置信度复杂度","authors":"A. Kiktenko, M. Lunkovskiy, K. Nikiforov","doi":"10.1109/EMISSION.2014.6893971","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":314830,"journal":{"name":"2014 2nd 2014 2nd International Conference on Emission Electronics (ICEE)","volume":"3 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Confidence complexity of computer algorithms\",\"authors\":\"A. Kiktenko, M. Lunkovskiy, K. Nikiforov\",\"doi\":\"10.1109/EMISSION.2014.6893971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":314830,\"journal\":{\"name\":\"2014 2nd 2014 2nd International Conference on Emission Electronics (ICEE)\",\"volume\":\"3 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 2nd 2014 2nd International Conference on Emission Electronics (ICEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMISSION.2014.6893971\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 2nd 2014 2nd International Conference on Emission Electronics (ICEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMISSION.2014.6893971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
