Results 141 to 150 of about 2,755,381 (193)
Some of the next articles are maybe not open access.
2022
An algorithm is a finite set of precise instructions that are performed to solve a problem. So, every algorithm is constructed using a finite sequence of statements. The origin of the word algorithm goes back to Muhammad Ibn Musa Al-Khwarizmi (ca.
openaire +2 more sources
An algorithm is a finite set of precise instructions that are performed to solve a problem. So, every algorithm is constructed using a finite sequence of statements. The origin of the word algorithm goes back to Muhammad Ibn Musa Al-Khwarizmi (ca.
openaire +2 more sources
Analysis of Covariance Algorithms
Biometrics, 1982Computational algorithms specific to the analysis of covariance are discussed for the treatment of both balanced and unbalanced data. The use of covariance algorithms in the solution of missing data problems is also considered.
openaire +1 more source
Sensitivity analysis of scheduling algorithms
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penz, Bernard +2 more
openaire +3 more sources
Analysis of free-storage algorithms
IBM Systems Journal, 1971Central to successful operation of a computer system based heavily on reentrant (or pure) procedures is reliable and efficient dynamic management of free storage. Such systems must allocate, use, and release one or more blocks of free storage for each task or system operation, e.g., each I/O task or each request for supervisor services.
B.H. Margolin +2 more
openaire +1 more source
2000
In this chapter we are not concerned with any specific model but will have a look at some common features shared by many solution techniques or algorithms. In order to avoid confusion, we will use the term problem to denote a general mathematical formulation such as a linear, nonlinear, integer etc., programming model, whereas an instance of a problem ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
In this chapter we are not concerned with any specific model but will have a look at some common features shared by many solution techniques or algorithms. In order to avoid confusion, we will use the term problem to denote a general mathematical formulation such as a linear, nonlinear, integer etc., programming model, whereas an instance of a problem ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
Convergence Analysis of Stochastic Algorithms
Mathematics of Operations Research, 1996This paper investigates asymptotic convergence to stationary points of gradient descent algorithms where the functions involved are not available in closed form but are approximated by sequences of random functions. The algorithms take large stepsizes and use progressively finer precision at successive iterations.
Shapiro, A., Wardi, Y.
openaire +2 more sources
Experimental Analysis of Algorithms
2002Summary: This article presents examples from broad research efforts in experimental algorithmics: first, to develop accurate models of computation that allow closer predictions of performance, and second, to extend abstract analyses beyond traditional questions and assumptions.
openaire +2 more sources
Runtime Analysis of Evolutionary Algorithms
Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2013Evolutionary algorithm theory has studied the time complexity of evolutionary algorithms for more than 20 years. Different aspects of this rich and diverse research field were presented in four different advanced or specialized tutorials at last year's GECCO. This tutorial presents the foundations of this field.
Per Kristian Lehre, Pietro S. Oliveto
openaire +1 more source