• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 50
  • 19
  • 8
  • 5
  • 2
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 100
  • 100
  • 17
  • 15
  • 14
  • 12
  • 11
  • 10
  • 10
  • 9
  • 8
  • 8
  • 8
  • 8
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

On the use of function values to improve quasi-Newton methods

Ghandhari, R. A. January 1989 (has links)
No description available.
2

CPGA : a two-dimensional order-based algorithm for cell placement /

Cooklis, John T. January 1991 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1991. / Spine title: A genetic algorithm for cell placement. Typescript. Includes bibliographical references.
3

The optimization of simulation models by genetic algorithms : a comparative study /

Yunker, James M., January 1993 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaves 110-116). Also available via the Internet.
4

Analysis and development of random search algorithms /

Birna Pala Kristinsdottir. January 1997 (has links)
Thesis (Ph. D.)--University of Washington, 1997. / Vita. Includes bibliographical references (leaves [127]-131).
5

On-line optimization of large dynamic systems

Marqúes, Dardo. January 1985 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1985. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 207-219).
6

Genroute : a genetic algorithm (printed wire board (PWB) router) /

Coward, Bob. January 1991 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1991. / Typescript. Includes bibliographical references.
7

Subset selection using nonlinear optimization /

Denton, Trip. Shokoufandeh, Ali, January 2007 (has links)
Thesis (Ph. D.)--Drexel University, 2007. / Includes abstract and vita. Includes bibliographical references (leaves 173-182).
8

Radar deception through phantom track generation

Maithripala, Diyogu Hennadige Asanka 12 April 2006 (has links)
This thesis presents a control algorithm to be used by a team of ECAVs (Electronic Combat Air Vehicle) to deceive a network of radars through the generation of a phantom track. Each ECAV has the electronic capability of intercepting and introducing an appropriate time delay to a transmitted pulse of a radar before transmitting it back to the radar, thereby deceiving the radar into seeing a phantom target at a range beyond that of the ECAV. A radar network correlates targets and target tracks to detect range delay based deception. A team of cooperating ECAVs, however, precisely plans their trajectories in a way all the radars in the radar network are deceived into seeing the same phantom. Since each radar in the network confirms the target track of the other, the phantom track is considered valid. An important feature of the algorithm achieving this is that it translates kinematic constraints on the ECAV dynamic system into constraints on the phantom point. The phantom track between two specified way points then evolves without violating any of the system constraints. The evolving phantom track in turn generates the actual controls on the ECAVs so that ECAVs have flyable trajectories. The algorithms give feasible but suboptimal solutions. The main objectives are algorithm development for phantom track generation through a team of cooperating ECAVs, development of the algorithms to be finite dimensional searches and determining necessary conditions for feasible solutions in the immediate horizon of the searches of the algorithm. Feasibility of the algorithm in deceiving a radar network through phantom track generation is demonstrated through simulation results.
9

Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms

Hunsaker, Braden K., January 2003 (has links) (PDF)
Thesis (Ph. D.)--School of Industrial and Systems Engineering, Georgia Institute of Technology, 2004. Directed by Ellis L. Johnson. / Vita. Includes bibliographical references (leaves 172-174).
10

The finite-element contrast source inversion method for microwave imaging applications

Zakaria, Amer 27 March 2012 (has links)
This dissertation describes research conducted on the development and improvement of microwave tomography algorithms for imaging the bulk-electrical parameters of unknown objects. The full derivation of a new inversion algorithm based on the state-of-the-art contrast source inversion (CSI) algorithm coupled to a finite-element method (FEM) discretization of the Helmholtz differential operator formulation for the scattered electromagnetic field is presented. The algorithm is applied to two-dimensional (2D) scalar and vectorial configurations, as well as three-dimensional (3D) full-vectorial problems. The unknown electrical properties of the object are distributed on the elements of arbitrary meshes with varying densities. The use of FEM to represent the Helmholtz operator allows for the flexibility of having an inhomogeneous background medium, as well as the ability to accurately model any boundary shape or type: both conducting and absorbing. The CSI algorithm is used in conjunction with multiplicative regularization (MR), as it is typical in most implementations of CSI. Due to the use of arbitrary meshes in the present implementation, new techniques are introduced to perform the necessary spatial gradient and divergence operators of MR. The approach is different from other MR-CSI implementations where the unknown variables are located on a uniform grid of rectangular cells and represented using pulse basis functions; with rectangular cells finite-difference operators can be used, but this becomes unwieldy in FEM-CSI. Furthermore, an improvement for MR is proposed that accounts for the imbalance between the real and imaginary parts of the electrical properties of the unknown objects. The proposed method is not restricted to any particular formulation of the contrast source inversion. The functionality of the new inversion algorithm with the different enhancements is tested using a wide range of synthetic datasets, as well as experimental data collected by the University of Manitoba electromagnetic imaging group and research centers in Spain and France.

Page generated in 0.1153 seconds