I now want to apply the basic notions of computational representations and abstract algebra that I have developed so far to concrete algorithms, and briefly to consider their complexity. As I explained earlier, underlying all of computer algebra are the integers, so I will begin by considering algorithms for performing arithmetic on integers of unlimited magnitude, which I will call long intege...

Abstract: Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quan...

Many algorithms in the field of evolutionary Bioinformatics have excessive computational requirements. This holds not only because of the continuous accumulation of molecular sequence data, which is driven by significant advances in wet-lab sequencing technologies, but it is also due to the high computational demands of the employed kernels. This dissertation presents new reconfigurable archite...

Genetic algorithms constitute a class of search algorithms especially suited to solving complex optimization problems in engineering. In addition to parameter optimization, genetic algorithms are also suggested for solving problems in creative design, such as combining components in a novel, creative way. Genetic algorithms (GA) transpose the notions of evolution in Nature to computers and imit...

Efficient scheduling techniques of computing resources are essential for achieving satisfactory performance for users as computer systems and their applications become more complex. In this paper, we survey research on scheduling algorithms, review previous classifications of scheduling problems, and present a broader classification scheme. Using a uniform terminology for scheduling strategies ...

Combinatorial optimization The search for an optimal 18 configuration in terms of a cost function on a discrete 19 set of allowed configurations. 20 Ground state The configuration of a model for a physi21 cal system of many interacting degrees of freedom de22 scribed by a Hamiltonian or energy function that has 23 the lowest energy. Also dented as the global minimum 24 of the energy of the syst...

in this paper, an enhanced computational code was developed using finite-volume method for solving the incompressible natural convection flow within the cylindrical cavities. grids were generated by an easy method with a view to computer program providing. an explicit integration algorithm was applied to find the steady state condition. also instead of the conventional algorithms of simple, sim...

The notes this week are based on several chapters of the very nice book by Lipson, which now unfortunately appears to be out of print. The first two sections of these notes provide a rapid summary of some of the basic notions of pure mathematics, as a reminder and in order to fix the notation and nomenclature that I will use. Subsequent sections summarize the properties of the computational dom...

When attempting to solve a multi-variate optimisation problem, it is often a wise strategy to sacrifice a locally-optimal solution in the hope of finding a better global solution. Algorithms that solve optimisation problems in this manner are sometimes called hill climbing algorithms . Recently, several new hillclimbing approaches have been proposed and have gained in popularity for solving spe...