NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 195
  • 187
  • 37
  • 7
  • Tagged with
  • 426
  • 175
  • 92
  • 91
  • 91
  • 76
  • 66
  • 57
  • 52
  • 46
  • 43
  • 43
  • 41
  • 33
  • 33
  • 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.

Search results

Showing 61 to 70 of 426 (0.026 seconds)
61

Looking inside genetic algorithms /

Wagner, Stefan. January 2005 (has links) (PDF)
Diplomarbeit Univ. Linz, 2004.
62

Techniques and heuristics for acquiring symbolic knowledge from examples.

Najmann, Oliver. Unknown Date (has links)
Universiẗat, Diss., 1992--Paderborn.
63

Population genetics and evolutionary computation : theoretical and practical aspects /

Affenzeller, Michael. January 2005 (has links)
Habilitation - Universität, Linz, 2004.
64

Verteilte Algorithmen zur Datenplazierung und zum Routing in gegnerischen Netzwerken /

Brinkmann, André. January 2004 (has links)
Zugl.: Paderborn, Universiẗat, Diss., 2004.
65

Massiv parallele Implementierung eines zustandsselektierenden MRCI-Algorithmus

Stampfuß, Philipp. Unknown Date (has links) (PDF)
Universiẗat, Diss., 2002--Dortmund.
MR-CI. Paralleler Algorithmus.
66

Universelle Algorithmen zur Portfolio-Optimierung

Lüssem, Jens. Unknown Date (has links) (PDF)
Universiẗat, Diss., 2003--Bonn.
Portfolio Selection. Online-Algorithmus.
67

Adaptive learning by genetic algorithms : analytical results and applications to economical models /

Dawid, Herbert. January 1996 (has links) (PDF)
Zugl.: Wien, Univ., Diss., 1996.
68

BINTEST: Binary Search-based Test Case Generation

Beydeda, Sami, Gruhn, Volker 08 November 2018 (has links)
One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation.
computer programming, algorithmus
69

A stable cubically convergent GR algorithm and Krylov subspace methods for non-hermitian matrix eigenvalue problems

Ziegler, Markus. Unknown Date (has links) (PDF)
University, Diss., 2001--Tübingen.
70

Design and analysis of sequential and parallel single-source shortest paths algorithms

Meyer, Ulrich. Unknown Date (has links) (PDF)
University, Diss., 2002--Saarbrücken.

Page generated in 0.0297 seconds