A study of data manipulation algorithms in magnetic bubble memories /

Thesis--Illinois.

Continued-product algorithms for division, logarithm, exponential and square root in radix ten /

Typescript.

Algorithms for parsing search queries in inverted file document retrieval systems /

Includes bibliographical references.

On Jacobi and Jacobi-like algorithms for a parallel computer /

Includes bibliographies.

On some optimal algorithms.

Thesis - University of Illinois at Urbana-Champaign.

Hand-held calculator algorithms for coastal engineering /

"January 1982."

Hand-held calculator algorithms for coastal engineering : (second series) /

"November 1982."

Process design and cost estimating algorithms for the computer assisted procedure for design and evaluation of wastewater treatment systems (CAPDET) /

"PB 82-190455."

Automatic traffic advisory and resolution service (ATARS) multi-site algorithms /

Mode of access: Internet.

Analysis of edge detection algorithms on DIAL /

Mode of access: Internet.

Genetic algorithms in statistical tolerancing

An important aspect in manufacturing design is the distribution of geometrical tolerances so that an assembly functions with given probability, while minimising the manufacturing cost. This requires a complex search over a multidimensional domain, much of which leads to infeasible solutions and which can have many local minima. As well, Monte-Carlo methods are often required to determine the probability that the assembly functions as designed. This paper describes a genetic algorithm for carrying out this search and successfully applies it to two specific mechanical designs, enabling comparisons of a new statistical tolerancing design method with existing methods. (C) 2003 Elsevier Ltd. All rights reserved.

Genetic algorithms with applications in wireless communications

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.