Algorithm and Complexity下载

weixin_39821620 2020-04-20 08:00:25

Algorithm and Complexity
相关下载链接：//download.csdn.net/download/morre/387986?utm_source=bbsseo

...全文

24 回复打赏收藏转发到动态举报

写回复

回复

切换为时间正序

请发表友善的回复…

发表回复

We propose a self-stabilizing algorithm for computing a maximal matching in an anony- mous network. The complexity is O(n2) moves with high probability, under the ad- versarial distributed daemon. Among all adversarial distributed daemons and with the anonymous assumption, our algorithm provides the best known complexity. Moreover, the previous best known algorithm working under the same daemon and using identity has a O(m) complexity leading to the same order of growth than our anonymous al- gorithm. Finally, we do not make the common assumption that a node can determine whether one of its neighbors points to it or to another node, and still we present a solution with the same asymptotic behavior.

Dynamic voltage scaling is an effective technique for power saving of processors. It adjusts the supply voltage and the frequency of the processors dynamically, thus the power consumption can be reduced. Based on the former research, we proposed an efficient DVS scheduling algorithm named CC-R-E-DVS, which is a kind of EDF scheduling. The DVS we proposed can reasonably use the slack time and reduce the computation cost as much as possible. In the best cases, it has a complexity of O(n). We simul

目录: 01. A first Course in Logic An Introduction To Model Theory Proof Theory Computability And Complexity - Shawn Hedman(djvu) 02. Advanced Complexity Theory Lctn - Madhu Sudan(pdf) 03. Algorithm and Complexity Lctn - Herbert S. Wilf(pdf) 04. Algorithms and Theory of Computation Handbook - Mikhail J. Atallah(djvu) 05. An Introduction to Formal Language Theory that Integrates Experimentation and Proof - Allen Stoughton(pdf) 06. An Introduction To Recursive Function Theory -Nigel Cutland(pdf) 07. An Introduction to the Theory of Computation - Eitan Gurari(pdf) 08. CLASSICAL RECURSION THEORY The Theory of Functions and Sets of Natural Numbers - Piergiorgio Odifreddi(djvu) 09. Complexity of Algorithms Lctn - Peter Gacs(pdf) 10. Computation Complexity Lctn - Laszlo Lovasz(pdf) 11. Computational Complexity - Christos Papadimitriou(djvu) 12. Computational Complexity A Conceptual Perspective - Oded Goldreich(pdf) 13. Computational Complexity A Modern Approach - Sanjeev Arora(pdf) 14. Computers And Intractability A Guide To The Theory Of Np-Completeness - Michael Garey(djvu) 15. Elementary Recursion Theory and its Applications to Formal Systems - Saul Kripke(pdf) 16. Elemnts Of The Theory Of Computation 2d ed - Harry Lewis(djvu) 17. Essentials of Theoretical Computer Science - F. D. Lewis(pdf) 18. Goldreich O. Introduction to Complexity Theory (lectures, 1999)(T)(375s)(djvu) 19. Goldreich O. Introduction to complexity theory, lecture notes (1999)(375s)(pdf) 20. Introduction To Automata Theory Languages , and Computation - John Hopcroft(djvu) 21. Introduction to Complexity Theory Lecture Notes - Oded Goldreich(pdf) 22. Introduction To The Theory Of Computation - Michael Sipser(djvu) 23. Kolmogorov Complexity and Computational Complexity - Osamu Watanabe(djvu) 24. Lecture Notes for Introduction to Theory of Computation - Robert Daley(pdf) 25. Lecture Notes On Algorithm Analysis And Computation Complexity 4th ed - Ian Parberry(pdf) 26. Lewis H.R., Papadimitriou C.H. Elements of the Theory of Computation (2ed., PH, 1998)(ISBN 0132624788)(K)(T)(375s)(djvu) 27. Models of Computation - An Introduction to Computability Theory (Undergrad Topics in CS), Springer (2009)(pdf) 28. Oxford University Press - A First Course in Logic - An Introduction to Model, Proof Theory, Computability, and Complexity - 2006(pdf) 29. Parallel Complexity Theory - Ian Parberry(pdf) 30. Recursion Theory for Metamathematics - RAYMOND M. SMULLYAN(djvu) 31. Rothe J. Complexity theory and cryptology.. an introduction to cryptocomplexity (TTCS, Springer, 2005)(ISBN 3540221476)(487s)(pdf) 32. Springer - Computational Probability - Algorithms and Applications in the Mathematical Sciences - 2008(pdf) 33. The Complexity of Boolean Functions - Ingo Wegener(pdf) 34. The Computational Complexity of Machine Learning - Michael J. Kearns(pdf) 35. Theory of Computation Lecture Notes - Abhijat Vichare(pdf)

To reduce computational complexity and maintain the image quality, an integer pixel fast motion estimation algorithm is proposed in this paper. Combining the characters of the UMHexagonS algorithm and the EPZS algorithm, the proposed algorithm selects various searching patterns according to the motion types of the image and introduces a early-termination algorithm. Experimental results demonstrate that the proposed algorithm has less ME time than FS, UMHexagonS and EPZS algorithm with essentially the same PSNR.

随书前言如下：Learn Data Structures and Algorithms with Go covers topics related to simple and advanced concepts in computer programming. The primary objective is to choose the correct algorithm and data structures for a problem. This book explains the concepts for comparing algorithm complexity and data structures in terms of code performance and efficiency.

下载资源悬赏专区

13,656

社区成员

12,674,810

社区内容

发帖

与我相关

我的任务

其他技术论坛（原bbs）

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章