Filters








3,965 Hits in 7.0 sec

Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) [article]

Paul M.B. Vitanyi
2009 arXiv   pre-print
Recently, many results on the computational complexity of sorting algorithms were obtained using Kolmogorov complexity (the incompressibility method).  ...  Especially in the case of Shellsort the uses of Kolmogorov complexity surprisingly easily resolved problems that had stayed open for a long time despite strenuous attacks.  ...  Introduction We survey recent results in the analysis of sorting algorithms using a new technical tool: the incompressibility method based on Kolmogorov complexity.  ... 
arXiv:0905.4452v1 fatcat:amug6iugczdb3b65kxjrxuemwu

Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) [chapter]

Paul Vitányi
Bolyai Society Mathematical Studies  
Recently, many results on the computational complexity of sorting algorithms were obtained using Kolmogorov complexity (the incompressibility method).  ...  Especially in the case of Shellsort the uses of Kolmogorov complexity surprisingly easily resolved problems that had stayed open for a long time despite strenuous attacks.  ...  Introduction We survey recent results in the analysis of sorting algorithms using a new technical tool: the incompressibility method based on Kolmogorov complexity.  ... 
doi:10.1007/978-3-540-32777-6_9 fatcat:ysgd77wni5fifbvhqezmyng4m4

Evolutionary Multimodal Optimization: A Short Survey [article]

Ka-Chun Wong
2015 arXiv   pre-print
In this chapter, we describe and review the state-of-the-arts evolutionary algorithms for multimodal optimization in terms of methodology, benchmarking, and application.  ...  With strong parallel search capability, evolutionary algorithms are shown to be particularly effective in solving this type of problem.  ...  To determine the species seeds in a population, the algorithm first sorts the population in a decreasing fitness order.  ... 
arXiv:1508.00457v1 fatcat:z3bisznvfzh77plpn5bp64pdt4

A Survey of Collectives [chapter]

Kagan Tumer, David Wolpert
2004 Collectives and the Design of Complex Systems  
This chapter provides a survey to the emerging science of collectives.  ...  Due to the increasing sophistication and miniaturization of computational components, complex, distributed systems of interacting agents are becoming ubiquitous.  ...  This work involves many aspects of Monte Carlo numerical algorithms [172] , all of Markov Chains [80, 177, 215] , and especially Markov fields, a topic that encompasses the Chapman-Kolmogorov equations  ... 
doi:10.1007/978-1-4419-8909-3_1 fatcat:h4vmhyrjvreqph3ivpl2d34lii

A survey of computability logic [article]

Giorgi Japaridze
2016 arXiv   pre-print
This article presents a survey of computability logic: its philosophy and motivations, main concepts and most significant results obtained so far.  ...  A continuously updated online version of this article is maintained at http://www.csc.villanova.edu/~japaridz/CL/ .  ...  The Kolmogorov complexity problem x y(y=k(x)) has no algorithmic solution.  ... 
arXiv:1612.04513v1 fatcat:i64bkywrvbf2bczm5jykqdffvy

The Minimum Description Length Principle for Pattern Mining: A Survey [article]

Esther Galbrun
2022 arXiv   pre-print
Mining patterns is a core task in data analysis and, beyond issues of efficient enumeration, the selection of patterns constitutes a major challenge.  ...  Finally, we open a discussion on some issues regarding these methods, and highlight currently active related data analysis problems.  ...  Constructive comments as well as pointers to missing related works are most welcome and will be considered to prepare a revision of this survey.  ... 
arXiv:2007.14009v4 fatcat:jd5ab66jtjevro54docp6qdakm

Artificial Musical Intelligence: A Survey [article]

Elad Liebman, Peter Stone
2020 arXiv   pre-print
This article provides a definition of musical intelligence, introduces a taxonomy of its constituent components, and surveys the wide range of AI methods that can be, and have been, brought to bear in  ...  its pursuit, with a particular emphasis on machine learning methods.  ...  In their method, after extracting initial predictions based on the N-gram model, a pruning stage takes place in an unsupervised fashion, by reducing the approx-imate Kolmogorov complexity of the drum sequence  ... 
arXiv:2006.10553v1 fatcat:2j6i27wrsfawpgcr2unxdgngd4

Network Coding Theory: A Survey

Riccardo Bassoli, Hugo Marques, Jonathan Rodriguez, Kenneth W. Shum, Rahim Tafazolli
2013 IEEE Communications Surveys and Tutorials  
The complexity of the algorithms is influenced by the size of the finite field required by the network code and depends on the number of sinks in the communication.  ...  The deployment of many tools from combinatorics and graph theory helped the design of algorithms with reduced complexity.  ...  Next, the work in [75] gave a combinatorial interpretation for a type of linear inequalities, which described the behaviours of both Shannon entropy and Kolmogorov complexity [76] , [77] .  ... 
doi:10.1109/surv.2013.013013.00104 fatcat:jgnf4i7rczfqrcyv7tygrydtxm

The Busy Beaver Competition: a historical survey [article]

Pascal Michel
2019 arXiv   pre-print
We give a historical survey of these works.  ...  The successive record holders in the Busy Beaver Competition are displayed, with their discoverers, the date they were found, and, for some of them, an analysis of their behavior.  ...  A proof using Kolmogorov complexity There is another proof of unprovability, based on Kolmogorov complexity.  ... 
arXiv:0906.3749v6 fatcat:hdetdxerfrhapinxtbc42tohye

The Problem of Distributed Consensus: A Survey [article]

Stephen Wolfram
2021 arXiv   pre-print
A survey is given of approaches to the problem of distributed consensus, focusing particularly on methods based on cellular automata and related systems.  ...  A variety of new results are given, as well as a history of the field and an extensive bibliography. Distributed consensus is of current relevance in a new generation of blockchain-related systems.  ...  of a distributed consensus algorithm in action.  ... 
arXiv:2106.13591v1 fatcat:xxb6xg2mtnb3jfxiufmybg524u

Neural Networks Based Cryptography: A Survey

Ishak MERAOUCHE, Sabyasachi DUTTA, Haowen Tan, Kouichi SAKURAI
2021 IEEE Access  
ACKNOWLEDGEMENT Ishak Meraouche is financially supported by the Ministry of Education, Culture, Sports, Science and Technology (MEXT) for his studies in Japan.  ...  Yujie Gu for her comments to improve the presentation of the paper.  ...  SECURITY ANALYSIS OF GANS-BASED CRYTOGRAPHY SCHEMES In this section, we will see a security analysis conducted by Zhou et al.  ... 
doi:10.1109/access.2021.3109635 fatcat:zhfaxrdiafad5nyu5ljokj3uza

A Survey on Feature Selection Techniques using Evolutionary Algorithms

Nishath Ansari
2021 Iraqi Journal of Science  
A comparison of these algorithms has been performed; the results show that the feature selection technique benefits machine learning algorithms by improving the performance of the algorithm.  ...  Here, furthermore, I discuss algorithms like the genetic algorithm (GA), the Non-Dominated Sorting Genetic Algorithm (NSGA-II), Particle Swarm Optimization (PSO), and some other meta-heuristic strategies  ...  All together, to explain the capability of a capital-run-length type of features, the Kolmogorov-Smirnov hypothesis test [36] is used to obtain an instance function.  ... 
doi:10.24996/ijs.2021.62.8.32 fatcat:llsxwyh7pjfsrowsx6kns2vvfe

Top-Down Induction of Decision Trees Classifiers—A Survey

L. Rokach, O. Maimon
2005 IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)  
This paper presents an updated survey of current methods for constructing decision tree classifiers in a top-down manner.  ...  The paper suggests a unified algorithmic framework for presenting these algorithms and describes the various splitting criteria and pruning methodologies.  ...  CONCLUSION This paper presented an updated survey of top-down decision trees induction algorithms.  ... 
doi:10.1109/tsmcc.2004.843247 fatcat:lzxedtztxfh3bj6gxfmuunxcwa

A Survey on Bias in Visual Datasets [article]

Simone Fabbrizzi, Symeon Papadopoulos, Eirini Ntoutsi, Ioannis Kompatsiaris
2021 arXiv   pre-print
Thus, both the problems of understanding and discovering biases are of utmost importance. Yet, to date there is no comprehensive survey on bias in visual datasets.  ...  A key conclusion of our study is that the problem of bias discovery and quantification in visual datasets is still open and there is room for improvement in terms of both methods and the range of biases  ...  This work is supported by the project "NoBias -Artificial Intelligence without Bias," which has received funding from the European Union's Horizon 2020 research and innovation programme, under the Marie  ... 
arXiv:2107.07919v1 fatcat:ibhsebbwwzaw3n5rdedmv3a6we

Metaheuristic optimization frameworks: a survey and benchmarking

José Antonio Parejo, Antonio Ruiz-Cortés, Sebastián Lozano, Pablo Fernandez
2011 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
A metric has been defined for each feature so that the scores obtained by a framework are averaged within each group of features, leading to a final average score for each framework.  ...  As criteria for comparison a set of 271 features grouped in 30 characteristics and 6 areas has been selected.  ...  Woodruff for their helpful comments in earlier versions of this article.  ... 
doi:10.1007/s00500-011-0754-8 fatcat:tetgfc7qz5h3xkeabsxv3gwgoe
« Previous Showing results 1 — 15 out of 3,965 results