Filters








3,563,604 Hits in 5.1 sec

Analysis of Algorithms and Partial Algorithms [chapter]

Andrew MacFie
2016 Lecture Notes in Computer Science  
We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward.  ...  That is, we want to find, what are the IQ scores of algorithms?  ...  Introduction: Shortcomings of Traditional Analysis of Algorithms Currently, the (running time) analysis of algorithms takes the following form.  ... 
doi:10.1007/978-3-319-41649-6_29 fatcat:vqw44ik7nbcrvbygzk2cajaj4u

Mizar Analysis of Algorithms: Algorithms over Integers

Grzegorz Bancerek
2008 Formalized Mathematics  
As examples the proofs of full correctness of two Euclid algorithms (with modulo operation and subtraction) and algorithm of exponentiation by squaring are given.  ...  Additional conditions (computability) limit the set of variables and expressions and, simultaneously, allow to write algorithms in a natural way (and to prove their correctness).  ...  (Def. 27) Let s be an element of Z X , v be an element of X Z X , and e be an element of Z Z X . Then it(s, the root tree of v, e ) = s +· (v(s), e(s)).  ... 
doi:10.2478/v10037-008-0024-0 fatcat:ztgamxlt2baa7mrdrckifwkipa

Analytic analysis of algorithms [chapter]

Philippe Flajolet
1992 Lecture Notes in Computer Science  
The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis.  ...  These analytic approaches allow an abstract discussion of asymptotic properties of combinatorial structures and schemas while opening the way for automatic analysis of whole classes of combinatorial algorithms  ...  This work was supported in part by the ESPRIT III Basic Research Action Programme of the E.C. under contract ALCOM II (#7141).  ... 
doi:10.1007/3-540-55719-9_74 fatcat:wz3qg4h5wfbyboteulobsrh2re

Probabilistic Analysis of Algorithms [chapter]

Alan M. Frieze, Bruce Reed
1998 Algorithms and Combinatorics  
¤ ' of the optimum. This was first observed by Burkard and Fincke [21] . More recent examples of this phenomenon are given by Barvinok [8] and Szpankowski [86] .  ...  Faster algorithms for easy problems In this section, we discuss the probabilistic analysis of algorithms for which polynomial time algorithms are known to exist.  ...  analysis.  ... 
doi:10.1007/978-3-662-12788-9_2 fatcat:455efq2sy5gnljb5wuzqgha5je

Analysis of combinatory algorithms

W. D. Frazer
1971 Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall)  
," viz., Analysis of a Analysis of a Class of Single Algorithm Algorithms Analysis of a Single Case (usually worst or best) Analysis of a Prob-1 --------+ ------1 ability Distribution of Cases The kinds  ...  Among all of the kinds of analysis to which algorithms are subjected, analysis of the variance of performance is unquestionably the most difficult-and the most often omitted.  ... 
doi:10.1145/1478873.1478937 dblp:conf/afips/Frazer72 fatcat:gzf2n3gd2bf3hnrvxh7d6qypru

Analysis of Virus Algorithms

Jyoti Kalyani, Karanjit Singh Kahlon, Harpal Singh, Anu Kalyani
2006 Journal of Computer Science  
The aim of this study was to give brief introduction about viruses and worms, their creators and characteristics of algorithms used by viruses. Here wired and wireless network viruses are elaborated.  ...  Security of wired and wireless networks is the most challengeable in today's computer world.  ...  FEATURES OF VARIOUS VIRUS ALGORITHMS Remember virus is a program. Therefore each virus has different code and algorithm.  ... 
doi:10.3844/jcssp.2006.785.788 fatcat:elsyuvtzu5devmmiijydohbszy

Smoothed analysis of algorithms

Daniel A. Spielman, Shang-Hua Teng
2004 Journal of the ACM  
We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case analyses of algorithms.  ...  In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small random perturbations of that input.  ...  We thank Alan Edelman for proposing the name "smoothed analysis". Finally, we thank the referees for their extrodinary efforts and many helpful suggestions.  ... 
doi:10.1145/990308.990310 fatcat:ac7hyrb2cjdtnjtue4znnis57y

ANALYSIS OF SHELLSORT ALGORITHMS

Avik Mitra, BCA Department The Heritage Academy Kolkata, India
2019 International Journal of Advanced Research in Computer Science  
However, the problem of finding proper of interleaving to achieve the minimum time complexity of O(n log n) is still open.  ...  The time complexity of Shellsort is dependent upon the method of interleaving (called increment sequence) giving variants of Shellsort.  ...  Therefore we have not considered the variant in our analysis. Based on similar reason (time complexity of genetic algorithms are generally high), [14] is also not considered.  ... 
doi:10.26483/ijarcs.v10i3.6433 fatcat:b3wj246iz5deleelxtmbv7lyse

Smoothed analysis of algorithms [article]

Daniel A. Spielman, Shang-Hua Teng
2002 arXiv   pre-print
Spielman and Teng introduced the smoothed analysis of algorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could not be understood through  ...  In this talk, we survey some of the smoothed analyses that have been performed.  ...  In the smoothed analysis of algorithms, we measure the expected performance of algorithms under slight random perturbations of worst-case inputs.  ... 
arXiv:math/0212413v1 fatcat:eqfdmfz2yzhi5pwaz7mgz3h5ze

Experimental Analysis of Algorithms [chapter]

Catherine C. McGeoch
2002 Nonconvex Optimization and Its Applications  
Another effort focuses on using experiments to extend and improve the kinds of results obtained in traditional algorithm analysis.  ...  of algorithms, or algorithm engineering.  ...  I thank the editor, Harold Boas, and an anonymous reviewer for several suggestions for improving the clarity of this article.  ... 
doi:10.1007/978-1-4757-5362-2_14 fatcat:xpz4aylbifbwjo2k5gq4zvht7y

Analysis of evolutionary algorithms

Thomas Jansen, Christine Zarges
2011 Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms - FOGA '11  
There is a lot of experimental evidence that crossover is, for some functions, an essential operator of evolutionary algorithms.  ...  Nevertheless, it was an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more e cient t h a n evolutionary algorithms without crossover.  ...  W e remark that the analysis of this variant of a genetic algorithm can be adapted to m = O(log n), too.  ... 
doi:10.1145/1967654.1967656 dblp:conf/foga/JansenZ11 fatcat:utnalcgznvd53j6kiljirjeosi

Smoothed analysis of algorithms

Daniel Spielman, Shang-Hua Teng
2001 Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01  
We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case analyses of algorithms.  ...  In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small random perturbations of that input.  ...  We thank Alan Edelman for proposing the name "smoothed analysis". Finally, we thank the referees for their extrodinary efforts and many helpful suggestions.  ... 
doi:10.1145/380752.380813 dblp:conf/stoc/SpielmanT01 fatcat:os7onzdzqzgwzl5gio6cvdw5c4

Performance Analysis of Interval Based Algorithms

2017 International Journal of Recent Trends in Engineering and Research  
With the help of the group key sharing the resources like accessing the files and implement the Queue-batch algorithm, which performs the best among the three intervalbased algorithms by comparing them  ...  The objectives of the project are to generate a group key.  ...  * 1)J + 1) + (N*-~ ( N * -~ L ' o ~ z ( ~ ' -~L)loJg)2)( N* -1) J = NfLlog2(N* -1)J +2~*-2(L'ogz(N*-l)J+l). ( 6 ) Analysis of the Batch Algorithm In analyzing the performance of the Batch algorithm,  ... 
doi:10.23883/ijrter.2017.3244.hdsjg fatcat:zcpuiri37nfuzombfhw3672tja

An Analysis of Rank Aggregation Algorithms [article]

Gattaca Lv
2014 arXiv   pre-print
In this paper, we extend a dynamic programming algorithm originally for Kemeny scores. We also provide details on the implementation of the algorithm.  ...  Experimental results show the usefulness and efficiency of the algorithm in practical settings.  ...  Kemeny ranking and its score, together with the comparative analysis of them.  ... 
arXiv:1402.5259v5 fatcat:5u2anjtvhfhbbcr4lbwnmb74x4

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time [article]

Daniel A. Spielman, Shang-Hua Teng
2003 arXiv   pre-print
We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms.  ...  In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small random perturbations of that input.  ...  Smoothed Analysis of Algorithms and Related Work We introduce the smoothed analysis of algorithms in the hope that it will help explain the good practical performance of many algorithms that worst-case  ... 
arXiv:cs/0111050v7 fatcat:egicx77z6fc43mqerxgei3kfdq
« Previous Showing results 1 — 15 out of 3,563,604 results