发布求助
文献互助 智能选刊 最新文献

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science最新文献

筛选
英文 中文
Progress measures for complementation omega -automata with applications to temporal logic 在时间逻辑应用中补充omega -自动机的进展措施
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185391
Nils Klarlund
{"title":"Progress measures for complementation omega -automata with applications to temporal logic","authors":"Nils Klarlund","doi":"10.1109/SFCS.1991.185391","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185391","url":null,"abstract":"A new approach to complementing omega -automata, which are finite-state automata defining languages of infinite words, is given. Instead of using usual combinatorial or algebraic properties of transition relations, it is shown that a graph-theoretic approach based on the notion of progress measures is a potent tool for complementing omega -automata. Progress measures are applied to the classical problem of complementing Buchi automata, and a simple method is obtained. The technique applies to Streett automata, for which an optimal complementation method is also obtained. As a consequence, it is seen that the powerful temporal logic ETLs is much more tractable than previously thought.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134167351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 83
How to pack better than best fit: tight bounds for average-case online bin packing 如何包装比最佳适合:平均情况下的紧密边界在线箱包装
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185444
P. Shor
{"title":"How to pack better than best fit: tight bounds for average-case online bin packing","authors":"P. Shor","doi":"10.1109/SFCS.1991.185444","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185444","url":null,"abstract":"An O(n log n)-time online algorithm is given for packing items i.i.d. uniform on (0, 1) into bins of size 1 with expected wasted space Theta (n/sup 1/2/ log /sup 1/2/n). This matches the lowest bound that no online algorithm can achieve O(n/sup 1/2/ log /sup 1/2/ n) wasted space. It is done by analyzing another algorithm which involves putting balls into buckets online. The analysis of this second algorithm also gives bound on the stochastic rightward matching problem, which arises in analyzing not only the above online bin packing problem, but also a 2-D problem of packing rectangles into a half-infinite strip. The bounds on rightward matching thus give good bounds for the 2-D strip packing problem.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128972156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Lower bounds for the complexity of reliable Boolean circuits with noisy gates 带噪声门的可靠布尔电路复杂度的下界
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185424
A. Gál
{"title":"Lower bounds for the complexity of reliable Boolean circuits with noisy gates","authors":"A. Gál","doi":"10.1109/SFCS.1991.185424","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185424","url":null,"abstract":"It is proved that the reliable computation of any Boolean function with, sensitivity s requires Omega (s log s) gates if the gates of the circuit fail independently with a fixed positive probability. The Omega (s log s) bound holds even if s is the block sensitivity instead of the sensitivity of the Boolean function. Some open problems are mentioned.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116005970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
On-line scheduling in the presence of overload 过载情况下的在线调度
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185354
Sanjoy Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha
{"title":"On-line scheduling in the presence of overload","authors":"Sanjoy Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha","doi":"10.1109/SFCS.1991.185354","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185354","url":null,"abstract":"The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115156911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 158
Explicit construction of natural bounded concentrators 自然有界集中器的显式构造
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185396
Moshe Morgenstern
{"title":"Explicit construction of natural bounded concentrators","authors":"Moshe Morgenstern","doi":"10.1109/SFCS.1991.185396","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185396","url":null,"abstract":"The first known direct construction for linear families of bounded concentrators is given. The construction is explicit, and the results are simple natural bounded concentrators.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127236251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Using approximation algorithms to design parallel algorithms that may ignore processor allocation 使用近似算法设计并行算法，可以忽略处理器分配
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185439
M. Goodrich
{"title":"Using approximation algorithms to design parallel algorithms that may ignore processor allocation","authors":"M. Goodrich","doi":"10.1109/SFCS.1991.185439","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185439","url":null,"abstract":"A framework is presented for designing parallel algorithms that may ignore processor allocation. A number of fast approximation algorithms are developed, and it is shown how to use these algorithms to simulate any algorithm that fits this framework in a work-preserving fashion on a randomized CRCW PRAM. Several applications of the approach to parallel computational geometry are given.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 43
Better bounds for threshold formulas 更好的阈值公式边界
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185384
J. Radhakrishnan
{"title":"Better bounds for threshold formulas","authors":"J. Radhakrishnan","doi":"10.1109/SFCS.1991.185384","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185384","url":null,"abstract":"The computation of threshold functions using formulas over the basis (AND, OR, NOT) is considered. It is shown that every monotone formula that computes the threshold function T/sub k//sup n/2<or=k<or=n/2, has size Omega (nk log (n/(k-1))). The same lower bound is shown to hold even in the stronger monotone contact networks model. Nearly optimal bounds on the size of Sigma Pi Sigma formulas computing T/sub k//sup n/ for small k are also shown.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM 连接组件在O(lg/sup 3/2 mod V/ mod)并联时间为CREW PRAM
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185437
Donald B. Johnson, P. Metaxas
{"title":"Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM","authors":"Donald B. Johnson, P. Metaxas","doi":"10.1109/SFCS.1991.185437","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185437","url":null,"abstract":"Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121524316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Dynamic three-dimensional linear programming 动态三维线性规划
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185410
D. Eppstein
{"title":"Dynamic three-dimensional linear programming","authors":"D. Eppstein","doi":"10.1109/SFCS.1991.185410","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185410","url":null,"abstract":"Linear programming optimizations on the intersection of k polyhedra in R/sup 3/, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+ square root k log k log/sup 3/ n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, an improved solution to the planar 2-center problem, is described.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125648995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 69
A unified geometric approach to graph separators 图形分隔符的统一几何方法
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185417
G. Miller, S. Teng, S. Vavasis
{"title":"A unified geometric approach to graph separators","authors":"G. Miller, S. Teng, S. Vavasis","doi":"10.1109/SFCS.1991.185417","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185417","url":null,"abstract":"A class of graphs called k-overlap graphs is proposed. Special cases of k-overlap graphs include planar graphs, k-nearest neighbor graphs, and earlier classes of graphs associated with finite element methods. A separator bound is proved for k-overlap graphs embedded in d dimensions. The result unifies several earlier separator results. All the arguments are based on geometric properties of embedding. The separator bounds come with randomized linear-time and randomized NC algorithms. Moreover, the bounds are the best possible up to the leading term.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122229727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 209
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信