Search results
Jump to navigation
Jump to search
- {{short description|Function used as a performance test problem for optimization algorithms}} ...tion Needs|url=https://marksmannet.com/RobertMarks/Classes/ENGR5358/Papers/functions.pdf |date=2005 |volume=101 |page=48}}</ref> ...2 KB (272 words) - 10:04, 13 January 2024
- {{short description|Function used as a performance test problem for optimization algorithms}} ...s.<ref>{{cite journal|last=Rosenbrock|first=H.H.|title=An automatic method for finding the greatest or least value of a function|journal=The Computer Jour ...6 KB (830 words) - 01:13, 29 September 2024
- ...date=2020-02-06|quote=GAUSS does not require any particular file extension for GAUSS program files, however, {{mono|.gss}} is recommended.}}</ref> ...es as well as functions in its [[Runtime library|Run-Time Library]] (i.e., functions that come with GAUSS without extra cost) ...6 KB (687 words) - 19:21, 9 May 2022
- In [[mathematics]], the '''second partial derivative test''' is a method in [[multivariable calculus]] used to determine if a [[Criti ==Functions of two variables== ...8 KB (1,240 words) - 08:37, 5 June 2025
- ...d as a [[benchmark (computing)|benchmark]] for languages with optimization for [[recursion]].<ref> {{cite journal | author=Peter Coffee| title=Tak test stands the test of time | journal=PC Week| year=1996 | volume=13 |issue=39 }} ...4 KB (626 words) - 13:16, 10 February 2025
- {{Short description|Stochastic method of global optimization}} ...unneling among regions containing function minima. Easier tunneling allows for faster exploration of sample space and faster convergence to a good solutio ...5 KB (639 words) - 11:58, 26 June 2024
- ...y, S. K., Evans, W., Muth, R., and De Sutter, B. 2000. Compiler techniques for code compaction. ACM Trans. Program. Lang. Syst. 22, 2 (Mar. 2000), 378–415 ...r [[Inline function|inline]] functions and enabling the use of [[link-time optimization]]. ...6 KB (851 words) - 06:32, 18 August 2024
- ...-dimensional and within which most functions are "anonymous", with special functions picked out by properties such as [[symmetry]], or relationship to [[harmoni See also [[List of types of functions]] ...10 KB (1,266 words) - 21:25, 10 August 2025
- {{Short description|Method for finding the extrema of a function}} In [[calculus]], a '''derivative test''' uses the [[derivative]]s of a [[function (mathematics)|function]] to loc ...13 KB (2,054 words) - 08:36, 5 June 2025
- '''PRTV''' (''Peterlee Relational Test Vehicle'') was the world's first [[relational database management system]] * implemented relational optimizer<ref name="Hall 1976a">{{cite journal|title=Optimization of a single relational expression in a relational database system|journal= ...5 KB (707 words) - 11:39, 9 April 2025
- {{short description|Computer program optimization method}} ...in programs containing many frequently used [[Function (computer science)|functions]] of small or medium length. IPO differs from other [[compiler optimization ...15 KB (2,175 words) - 15:14, 26 February 2025
- {{Short description|Type of compiler optimization}} ...ompilers would not actually generate two multiply instructions and a store for this statement. Instead, they identify constructs such as these and substit ...6 KB (855 words) - 22:25, 4 May 2025
- {{Short description|Numerical optimization algorithm}} {{distinguish|text=Dantzig's [[simplex algorithm]] for the problem of linear optimization}} ...17 KB (2,555 words) - 16:52, 25 April 2025
- **[[0-1 test for chaos]] ==Functions defined via an ODE== ...5 KB (476 words) - 21:49, 5 November 2024
- ...arithmetic]], [[elementary algebra]], [[statistics]] and [[probability]]. For some management problems, more advanced mathematics - [[calculus]], [[Matr ...[[Secondary education in the United States#Core|the general math credit]] for high school students.<ref name="consumer math"/> ...11 KB (1,381 words) - 23:41, 20 December 2024
- ...lony optimization algorithms|ant colony optimization]] or [[particle swarm optimization]]. ...ecification, and this is generated by applying the fitness function to the test or simulation results obtained from that candidate solution.<ref name="intr ...23 KB (3,347 words) - 21:15, 22 May 2025
- [[File:Extrema example original.svg|thumb|Local and global maxima and minima for cos(3π''x'')/''x'', 0.1≤'' x ''≤1.1]] ...a general technique, [[adequality]], for finding the maxima and minima of functions. ...17 KB (2,608 words) - 05:37, 23 March 2025
- === Second-derivative test === {{Main|Second partial derivative test}} ...22 KB (3,341 words) - 07:54, 25 June 2025
- ...on|Branch of information theory which provides the theoretical foundations for lossy data compression}} ...ranch of [[information theory]] which provides the theoretical foundations for [[lossy data compression]]; it addresses the problem of determining the min ...15 KB (2,307 words) - 09:59, 31 March 2025
- ...08 for his achievements in education and his development of the technology for [[Automata-based programming]] called "[[Switch-technology]]." He is also a * Introduced a [[Switch-technology]] for [[Automata-Based Programming]]. He is also a co-author of a [[UniMod]] tool ...16 KB (2,006 words) - 08:21, 5 November 2024