Search for "Algorithms" in article titles:

1. Algorithms: An algorithm is, in layman's terms, a method to go about achieving a particular task. Usually, this task is meant to be performed by a computer or other machine, like calculations and data analysis; however, its definition can be ... [100%] 2024-01-03 [Algorithms]
2. Genetic Algorithms: $\newcommand{\argmin}{\operatorname{argmin}_{#1}}$ Genetic algorithms (GAs) (also known as evolutionary algorithms ) assume a discrete search space $H$ and a function $f:H\to \R$. The general problem is to find $\argmin{x\in H}f$, where $x ... (Mathematics) [70%] 2024-01-26
3. Algorithms Unlocked: Algorithms Unlocked is a book by Thomas H. Cormen about the basic principles and applications of computer algorithms. [70%] 2024-01-26 [2013 non-fiction books] [Computer science books]...
4. Navigational Algorithms: The navigational algorithms are the quintessence of the executable software on portable calculators or PDA as an aid to the art of navigation, this attempt article describe both algorithms and software for "PC-PDA" implementing different calculation procedures for navigation ... (Astronomy) [70%] 2023-11-03 [Navigation] [Celestial navigation]...
5. Genetic Algorithms: $\newcommand{\argmin}{\operatorname{argmin}_{#1}}$ Genetic algorithms (GAs) (also known as evolutionary algorithms ) assume a discrete search space $H$ and a function $f:H\to \R$. The general problem is to find $\argmin{x\in H}f$, where $x ... (Mathematics) [70%] 2023-08-31
6. Algorithms Unlocked: Algorithms Unlocked is a book by Thomas H. Cormen about the basic principles and applications of computer algorithms. [70%] 2023-11-27 [2013 non-fiction books] [Computer science books]...
7. Introduction to Algorithms: This course is a part of The School of Computer engineering. [57%] 2023-12-13 [Computer science] [Introductions]...
8. Introduction to Algorithms: This course is a part of The School of Computer engineering. [57%] 2024-01-26 [Computer science] [Introductions]...
9. Geometric Folding Algorithms: Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN ... [57%] 2023-10-27 [Linkages (mechanical)] [Polyhedra]...
10. Algorithms of Oppression: Algorithms of Oppression: How Search Engines Reinforce Racism is a 2018 book by Safiya Umoja Noble in the fields of information science, machine learning, and human-computer interaction. Noble earned an undergraduate degree in sociology from California State University, Fresno ... (2018 book by Safiya Umoja Noble) [57%] 2024-01-04 [Books about race and ethnicity] [Algorithms]...
11. Algorithms of Oppression: Algorithms of Oppression: How Search Engines Reinforce Racism is a 2018 book by Safiya Umoja Noble in the fields of information science, machine learning, and human-computer interaction. Noble earned an undergraduate degree in sociology from California State University, Fresno ... (2018 book by Safiya Umoja Noble) [57%] 2023-11-30 [Algorithms] [Information science]...
12. Numerical Algorithms Group: The Numerical Algorithms Group (NAG) is a software and services company which provides methods for the solution of mathematical and statistical problems, and offers services to users of High performance computing (HPC) systems. Its products and services are employed by ... (Company) [57%] 2024-03-22 [Fortran compilers]
13. Secure Hash Algorithms: The Secure Hash Algorithms are a family of cryptographic hash functions published by the National Institute of Standards and Technology. The corresponding standards are FIPS PUB 180 (original SHA), FIPS PUB 180-1 (SHA-1), FIPS PUB 180-2 (SHA ... (Family of cryptographic hash functions) [57%] 2024-05-20 [Cryptography]
14. Developing Data Redistribution Algorithms: from [ Haskell_programming_in_plain_view ] go to [ Electrical_&_Computer_Engineering_Studies ] * Idea.2.A (pdf) moved to CORDIC Hardware Implementations. [50%] 2023-12-15 [Logic] [Mathematics]...
15. Algorithms and Data Structures: Algorithm -- briefly, is a step-by-step instruction that as a whole complete a process. Usually this process solves problems such as sorting , finding data, and many other problems. [50%] 2024-01-03 [Algorithms]
16. Algorithms for calculating variance: Algorithms for calculating variance play a major role in computational statistics. A key difficulty in the design of good algorithms for this problem is that formulas for the variance may involve sums of squares, which can lead to numerical instability ... (Important algorithms in numerical statistics) [50%] 2023-02-17 [Statistical algorithms] [Statistical deviation and dispersion]...
17. Data Structures and Algorithms: Welcome to this learning project about Data Structures and Algorithms! This learning project introduces how to encapsulate and order data in a computer program along with efficient methods of accessing the data using appropriate algorithms. [50%] 2024-01-11 [Computer science] [Data Structures and Algorithms]...
18. European Symposium on Algorithms: The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. (Annual conference series on algorithms) [50%] 2023-04-02 [Theoretical computer science conferences]
19. Understanding FPGA Image Processing Algorithms: See D. Bailey's Book "Design for Embedded Image Processing on FPGAs" See an EURASIP papar See a median filter paper See A. [44%] 2023-04-05 [Algorithms]
20. Design and Analysis of Algorithms: Donald Knuth lists, in the preface of The Art of Computer Programming Vol 3, the following as the important questions of design and analysis of algorithms: solve the recurrence equuation for t(n)=2t(n-1)+n2^n+n^2 ... [44%] 2023-12-13 [Computer programming] [School of Computer Science]...
21. Fast Algorithms for Multidimensional Signals: Similar to 1-D Digital signal processing in case of the Multidimensional signal processing we have Efficient algorithms. The efficiency of an Algorithm can be evaluated by the amount of computational resources it takes to compute output or the quantity ... [44%] 2023-01-13 [Multidimensional signal processing] [Digital signal processing]...
22. Art Gallery Theorems and Algorithms: Art Gallery Theorems and Algorithms is a mathematical monograph on topics related to the art gallery problem, on finding positions for guards within a polygonal museum floorplan so that all points of the museum are visible to at least one ... [44%] 2023-12-28 [Computational geometry] [Polygons]...
23. Journal of Graph Algorithms and Applications: The Journal of Graph Algorithms and Applications is an open access peer-reviewed scientific journal covering the subject of graph algorithms and graph drawing. The journal was established in 1997 and the editor-in-chief is Giuseppe Liotta (University of ... [40%] 2023-09-15 [Computer science journals] [Mathematics journals]...
24. Journal of Graph Algorithms and Applications: The Journal of Graph Algorithms and Applications is a diamond open access peer-reviewed scientific journal covering the subject of graph algorithms and graph drawing. The journal was established in 1997 and the current co-editors-in-chief are Emilio ... [40%] 2024-09-13 [Computer science journals] [Graph theory journals]...
25. Algorithms for Recovery and Isolation Exploiting Semantics: In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES is a recovery algorithm designed to work with a no-force, steal database approach; it is used by IBM Db2, Microsoft SQL Server and many other database systems. (Recovery algorithm) [37%] 2022-10-19 [Database algorithms]
26. Library of Efficient Data types and Algorithms: The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad variety of algorithms for graph theory and computational geometry. It was originally developed by the Max Planck Institute for ... (Software library) [37%] 2023-11-25 [Computer libraries]
27. Genetic algorithms: Genetic algorithms or GAs view learning as a competition among a population of evolving candidate problem solutions. A 'fitness' function estimates each solution for deciding whether it will contribute to the next generation of solutions or not. [70%] 2024-01-26
28. Hermann algorithms: In her famous 1926 paper , G. Hermann set out to show that all standard objects in the theory of polynomial ideals over fields $k$, including the prime ideals associated to a given ideal, can be determined by means of computations ... (Mathematics) [70%] 2024-01-26
29. Sorting algorithms: Sorting algorithms are processes to follow for sorting lists of data. They are commonly used as an introduction to algorithms for students of computer science. [70%] 2024-01-26
30. Standard algorithms: In elementary arithmetic, a standard algorithm or method is a specific method of computation which is conventionally taught for solving particular mathematical problems. These methods vary somewhat by nation and time, but generally include exchanging, regrouping, long division, and long ... [70%] 2023-05-27 [Mathematics education]
31. XDAIS algorithms: XDAIS or eXpressDsp Algorithm Interoperability Standard is a standard for algorithm development by Texas Instruments for the TMS320 DSP family. The standard was first introduced in 1999 and was created to facilitate integration of DSP algorithms into systems without re ... [70%] 2022-06-09 [Digital signal processing]
32. Genetic algorithms: Genetic algorithms or GAs view learning as a competition among a population of evolving candidate problem solutions. A 'fitness' function estimates each solution for deciding whether it will contribute to the next generation of solutions or not. [70%] 2023-07-05
33. Genetic algorithms: Genetic algorithms are based on the classic view of a chromosome as a string of genes. R.A. [70%] 2021-12-24 [Computational Intelligence] [Evolutionary Computation]...
34. Numerical algorithms: Numerical Algorithms is a set of courses in the Department of Scientific Computing in the School of Computer Science. As a topic of study, it has a lot of overlap with Topic:Numerical analysis. [70%] 2023-12-19 [Computer science]
35. Hermann algorithms: In her famous 1926 paper , G. Hermann set out to show that all standard objects in the theory of polynomial ideals over fields $k$, including the prime ideals associated to a given ideal, can be determined by means of computations ... (Mathematics) [70%] 2023-10-25
36. Genetic algorithms: Genetic algorithms or GAs view learning as a competition among a population of evolving candidate problem solutions. A 'fitness' function estimates each solution for deciding whether it will contribute to the next generation of solutions or not. [70%] 2023-11-29 [Artificial intelligence]
37. Sorting algorithms: Sorting algorithms are processes to follow for sorting lists of data. They are commonly used as an introduction to algorithms for students of computer science. [70%] 2023-07-19
38. Navigational algorithms: The navigational algorithms are the quintessence of the executable software on portable calculators or PDA as an aid to the art of navigation, this attempt article describe both algorithms and software for "PC-PDA" implementing different calculation procedures for navigation ... (Astronomy) [70%] 2023-11-03 [Navigation] [Celestial navigation]...
39. Genetic algorithms: A genetic algorithm is a stochastic numerical algorithm used to solve optimization problems where analytic or step-wise optimization is impossible or intractable. Genetic algorithms are a popular subset of Evolutionary algorithms which use common concepts in evolutionary biology and ... [70%] 2023-02-04 [Mathematics] [Computer Science]...
40. Convex hull algorithms: Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational ... (Class of algorithms in computational geometry) [57%] 2022-07-21 [Convex hull algorithms]
41. Communication-avoiding algorithms: Communication-avoiding algorithms minimize movement of data within a memory hierarchy for improving its running-time and energy consumption. These minimize the total of two costs (in terms of time and energy): arithmetic and communication. [57%] 2022-12-05 [Parallel computing] [Algorithms]...
42. List of algorithms: The following is a list of well-known algorithms along with one-line descriptions for each. (none) [57%] 2023-11-30 [Algorithms] [Mathematics-related lists]...
43. Root-finding algorithms: In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the ... (Algorithms for zeros of functions) [57%] 2024-01-01 [Root-finding algorithms]
44. Complexity of algorithms: In computer science, the complexity of an algorithm is a way to classify how efficient an algorithm is, compared to alternative ones. The focus is on how execution time increases with the data set to be processed. [57%] 2024-01-26
45. Analysis of algorithms: In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them. Usually, this involves determining a function that relates the size of ... (Study of resources used by an algorithm) [57%] 2024-01-26 [Analysis of algorithms] [Computational complexity theory]...
46. Algorithms, theory of: The branch of mathematics dealing with the general properties of algorithms (cf. Algorithm). (Mathematics) [57%] 2024-01-26
47. Regulation of algorithms: Regulation of algorithms, or algorithmic regulation, is the creation of laws, rules and public sector policies for promotion and regulation of algorithms, particularly in artificial intelligence and machine learning. For the subset of AI algorithms, the term regulation of artificial ... (Government regulation) [57%] 2023-11-30 [Computer law] [Algorithms]...
48. Analysis of algorithms: In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them. Usually, this involves determining a function that relates the size of ... (Study of resources used by an algorithm) [57%] 2023-12-22 [Analysis of algorithms] [Computational complexity theory]...