Search results
Jump to navigation
Jump to search
Page title matches
- {{Short description|Graph theory algorithms}} ...]s. Kleitman and Wang <ref>{{harvtxt|Kleitman|Wang|1973}}</ref> gave these algorithms in 1973. ...4 KB (747 words) - 20:56, 12 October 2024
- {{Short description|Optimization algorithms using quantum computing}} ...|last18=Temme|first18=Kristan|title=Quantum optimization using variational algorithms on near-term quantum devices|journal=Quantum Science and Technology|date=20 ...25 KB (3,714 words) - 06:08, 28 February 2025
- '''Algorithms and Combinatorics''' ({{ISSN|0937-5511}}) is a [[book series]] in mathemati *''Geometric Algorithms and Combinatorial Optimization'' ([[Martin Grötschel]], [[László Lovász]], ...4 KB (569 words) - 19:18, 5 July 2024
- {{Evolutionary algorithms}} In [[evolutionary computing]] such as [[genetic algorithms]] and [[genetic programming]], '''propagation''' refers to the inheritance ...7 KB (1,145 words) - 10:53, 2 January 2025
- ...respects, analysis of [[parallel algorithm]]s is similar to [[analysis of algorithms|the analysis]] of [[sequential algorithm]]s, but is generally more involved | journal = Journal of Algorithms ...10 KB (1,440 words) - 12:51, 27 January 2025
- ...inary search tree]]s. This framework aims at designing highly-parallelized algorithms for various balanced binary search trees. The algorithmic framework is base ...on Parallel Algorithms and Architectures, Proc. of 28th ACM Symp. Parallel Algorithms and Architectures (SPAA 2016) ...19 KB (2,971 words) - 09:24, 18 April 2024
- {{short description|Set of related approximation algorithms for the bin packing problem}} ...he number of bins in the optimal solution. They also devised several other algorithms with slightly different approximation guarantees and run-time bounds. ...30 KB (5,319 words) - 20:03, 17 January 2025
- ...tput or the quantity of interest. In this page, two of the very efficient algorithms for multidimensional signals are explained. For the sake of simplicity and ...am]], Image Enhancements, etc. Direct implementation <ref name = "fa">Fast Algorithms for Signal Processing by Richard E. Blahut, Cambridge University Press 2010 ...12 KB (1,983 words) - 10:34, 22 February 2024
- ...orithms for Atomic DEVS#References|[Zeigler84]]] originally introduced the algorithms that handle time variables related to ''lifespan'' <math>t_s \in [0,\infty] ...ternal transition function (refer to [[Behavior of DEVS]]), the simulation algorithms are also introduced in two different views as below. ...4 KB (677 words) - 18:39, 7 March 2021
- '''''Art Gallery Theorems and Algorithms''''' is a mathematical monograph on topics related to the [[art gallery pro ...overing problems|coverings of polygons]], triangulations and triangulation algorithms, and higher-dimensional generalizations,{{r|edels}} including the result th ...5 KB (766 words) - 19:44, 24 November 2024
- ...rithms for Coupled DEVS#References|[Zeigler84]]] originally introduced the algorithms that handle time variables related to ''lifespan'' <math>t_s \in [0,\infty] Based on these relationships, the algorithms to simulate the behavior of a given Coupled DEVS are written as follows. ...4 KB (570 words) - 19:47, 22 December 2022
- ...lel algorithm|parallelising]] known [[Minimum_spanning_tree#Algorithms|MST algorithms]].<ref>{{cite book |last1=Sanders |last2=Dietzfelbinger |last3=Martin |last ...anford.edu/~rezab/dao/notes/lecture06/cme323_lec6.pdf |website=Distributed Algorithms and Optimization Stanford University Homepage |access-date=25 February 2019 ...19 KB (3,006 words) - 01:04, 31 July 2023
- {{short description|Algorithms and methods of plotting the Mandelbrot set on a computing device}} ...the color of individual [[pixel]]s efficiently. <!-- There have been many algorithms developed to efficiently plot the Mandelbrot set via a computing device. So ...50 KB (7,715 words) - 01:25, 27 February 2025
- ...ices, the nature of those algorithms are to some extent different from the algorithms working on sparse matrices.<ref name="donoho2012information"/><ref name="Ch ...ref>[[Anna C. Gilbert|Gilbert, Anna C.]], et al. "One sketch for all: fast algorithms for compressed sensing." Proceedings of the thirty-ninth annual ACM symposi ...21 KB (3,321 words) - 23:03, 28 August 2024
Page text matches
- ...roximation error|error bound]] in [[Boosting (machine learning)|boosting]] algorithms and [[support vector machine]]s is particularly prominent. ==Margin for boosting algorithms== ...4 KB (629 words) - 22:28, 3 November 2024
- ...hine|oracle]]-based problem. Various versions of this problem have quantum algorithms which can run much more quickly than known non-quantum methods for the same ...itle = Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 ...3 KB (466 words) - 09:00, 30 June 2024
- ...algorithms based on finding all nearest smaller values|journal=Journal of Algorithms|volume=14|pages=344–370|year=1993|issue=3|doi=10.1006/jagm.1993.1018|citese ...://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650 Cache-Oblivious Algorithms]. Masters thesis, MIT. 1999.</ref> ...2 KB (267 words) - 04:28, 31 July 2024
- ...[[Nimrod Megiddo]] in 1983.<ref name=lp3>Nimrod Megiddo (1983) Linear-time algorithms for linear programming in R<sup>3</sup> and related problems. SIAM J. Compu ...)}}. This can be seen either by applying the [[master theorem (analysis of algorithms)|master theorem for divide-and-conquer recurrences]] or by observing that t ...2 KB (300 words) - 20:23, 1 July 2023
- ...date=22 September 2023 |url=https://www.prodigitalweb.com/machine-learning-algorithms-for-beginners/ |access-date=2023-10-01 |language=en-US}}</ref> [[Category:Classification algorithms]] ...2 KB (202 words) - 08:43, 11 December 2024
- ...ty of the lower bounding schemes which are adopted by [[branch and bound]] algorithms for solving multiprocessor scheduling problem. Fernandez's problem derives [[Category:Optimization algorithms and methods]] ...1,023 bytes (137 words) - 06:39, 17 June 2024
- == Analysis of common parallel algorithms == ...Bader| first1=David A.|last2=Jaja |first2=Joseph |title=Practical parallel algorithms for dynamic data redistribution, median finding, and selection|journal=Proc ...2 KB (359 words) - 01:19, 15 September 2024
- ==Properties and algorithms== ...)/2 edges, a rectilinear minimum spanning tree can be found using existing algorithms for finding a minimum spanning tree. In particular, using [[Prim's algorith ...3 KB (380 words) - 01:48, 17 April 2024
- ...do not use derivatives or finite differences are called '''derivative-free algorithms'''.<ref name="CSV" >{{cite book|last=Conn |first=A. R. |last2=Scheinberg |f ...local hill-climbing in the objective function landscape. Derivative-based algorithms use derivative information of <math>f</math> to find a good search directio ...5 KB (625 words) - 07:10, 20 April 2024
- ...rithms for Coupled DEVS#References|[Zeigler84]]] originally introduced the algorithms that handle time variables related to ''lifespan'' <math>t_s \in [0,\infty] Based on these relationships, the algorithms to simulate the behavior of a given Coupled DEVS are written as follows. ...4 KB (570 words) - 19:47, 22 December 2022
- {{Short description|Graph theory algorithms}} ...]s. Kleitman and Wang <ref>{{harvtxt|Kleitman|Wang|1973}}</ref> gave these algorithms in 1973. ...4 KB (747 words) - 20:56, 12 October 2024
- |journal=Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms |title = Algorithms and Computation ...3 KB (469 words) - 17:46, 5 May 2021
- ...orithms for Atomic DEVS#References|[Zeigler84]]] originally introduced the algorithms that handle time variables related to ''lifespan'' <math>t_s \in [0,\infty] ...ternal transition function (refer to [[Behavior of DEVS]]), the simulation algorithms are also introduced in two different views as below. ...4 KB (677 words) - 18:39, 7 March 2021
- == Algorithms == ...3 KB (460 words) - 13:50, 25 February 2025
- ...019}}{{Short description|Description of limiting behavior in probabilistic algorithms}} ...thm for verifying matrix multiplication. It runs faster than deterministic algorithms WHP. ...3 KB (429 words) - 02:19, 9 January 2025
- ...e|inner product]] between a query and the data items to be retrieved. MIPS algorithms are used in a wide variety of big data applications, including [[recommenda ...is generally too slow to be used on practical problems. However, efficient algorithms exist to speed up MIPS search.<ref name="Abuzaid" /><ref>Steve Mussmann, St ...3 KB (449 words) - 20:45, 13 May 2024
- ...6566140 }}</ref> (a parody of ''[[asymptotically optimal algorithm|optimal algorithms]]'' and ''[[computational complexity theory|complexity analysis]]''). [[Category:Sorting algorithms]] ...3 KB (407 words) - 00:06, 26 February 2025
- ...llipop graphs are extremal for commute times|journal=Random Structures and Algorithms|date=March 2000|volume=16|issue=2|pages=131–142|doi=10.1002/(SICI)1098-2418 ...2 KB (272 words) - 00:10, 2 May 2024
- ...r | first1 = Michael | last2 = Vassilvitskii | first2 = Sergei | chapter = Algorithms with Predictions | date = 31 December 2020 | pages = 646–662 | publisher = ...gular algorithms just the problem instance is inputted, learning augmented algorithms accept an extra parameter. ...5 KB (780 words) - 12:03, 17 February 2025
- ...Glauber dynamics|heat bath]] or [[Metropolis–Hastings algorithm|Metropolis algorithms]]) but a cluster of them. This cluster is defined as the set of connected s The advantage of Wolff algorithm over other algorithms for magnetic spin simulations like single spin flip is that it allows non-l ...3 KB (369 words) - 00:29, 31 October 2022