堆栈超过一定大小的平均次数

IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications Pub Date : 2014-07-07 DOI:10.1109/IISA.2014.6878799

K. Manes, I. Tasoulas

{"title":"堆栈超过一定大小的平均次数","authors":"K. Manes, I. Tasoulas","doi":"10.1109/IISA.2014.6878799","DOIUrl":null,"url":null,"abstract":"We obtain an explicit as well as an asymptotic formula for the average number of times a stack exceeds a fixed size j, after the execution of n push operations. The stack is assumed to have limitless capacity and all possible sequences of push and pop operations are considered to be equally likely.","PeriodicalId":298835,"journal":{"name":"IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The average number of times a stack exceeds a certain size\",\"authors\":\"K. Manes, I. Tasoulas\",\"doi\":\"10.1109/IISA.2014.6878799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We obtain an explicit as well as an asymptotic formula for the average number of times a stack exceeds a fixed size j, after the execution of n push operations. The stack is assumed to have limitless capacity and all possible sequences of push and pop operations are considered to be equally likely.\",\"PeriodicalId\":298835,\"journal\":{\"name\":\"IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IISA.2014.6878799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IISA.2014.6878799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在执行n次push操作后，我们得到了堆栈超过固定大小j的平均次数的显式和渐近公式。假定堆栈具有无限的容量，并且认为所有可能的push和pop操作序列的可能性都是相等的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The average number of times a stack exceeds a certain size

We obtain an explicit as well as an asymptotic formula for the average number of times a stack exceeds a fixed size j, after the execution of n push operations. The stack is assumed to have limitless capacity and all possible sequences of push and pop operations are considered to be equally likely.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications

自引率

0.00%

发文量