NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 28
  • 9
  • 3
  • Tagged with
  • 40
  • 40
  • 7
  • 6
  • 6
  • 5
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 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 21 to 30 of 40 (0.094 seconds)

Spelling suggestions: "subject:"kombinatorische abbauoptimierung"" "subject:"kombinatorische ablaufoptimierung""

21

Parallelization strategies for the ant system

Bullnheimer, Bernd, Kotsis, Gabriele, Strauß, Christine January 1997 (has links) (PDF)
The Ant System is a new meta-heuristic method particularly appropriate to solve hard combinatorial optimization problems. It is a population-based, nature-inspired approach exploiting positive feedback as well as local information and has been applied successfully to a variety of combinatorial optimization problem classes. The Ant System consists of a set of cooperating agents (artificial ants) and a set of rules that determine the generation, update and usage of local and global information in order to find good solutions. As the structure of the Ant System highly suggests a parallel implementation of the algorithm, in this paper two parallelization strategies for an Ant System implementation are developed and evaluated: the synchronous parallel algorithm and the partially asynchronous parallel algorithm. Using the Traveling Salesman Problem a discrete event simulation is performed, and both strategies are evaluated on the criteria "speedup", "efficiency" and "efficacy". Finally further improvements for an advanced parallel implementation are discussed. (author's abstract) / Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
22

Abbruchkriterien für Markovsche Optimierungsverfahren im Rahmen der Ablaufplanung /

Schwindl, Kurt. January 2009 (has links)
Zugl.: Münster (Westfalen), Universiẗat, Diss.
23

The problem of tuning metaheuristics as seen from the machine learning perspective

Birattari, Mauro January 2005 (has links)
Zugl.: Brüssel, Univ., Diss., 2005
24

Protein folding and self-avoiding walks polyhedral studies and solutions /

Dittel, Agnes. January 2008 (has links)
Zugl.: Darmstadt, Techn. University, Diss., 2008.
25

pb.net: Konzeption, Design und Implementierung eines Frameworks zur Entwicklung von Heuristiken für kombinatorische Probleme

Bartodziej, Paul January 2009 (has links)
Zugl.: Köln, Univ., Diss., 2009
26

Standortplanung von Bahnhöfen

Mecke, Steffen. January 2003 (has links)
Konstanz, Univ., Diplomarb., 2003.
27

Convex Mathematical Programs for Relational Matching of Object Views

Schellewald, Christian. January 2005 (has links)
Mannheim, Univ., Diss., 2004.
28

Image partitioning based on semidefinite programming

Keuchel, Jens. January 2004 (has links)
Mannheim, Univ., Diss., 2004.
29

Polyhedra and algorithms for the general routing problem

Theis, Dirk Oliver. January 2005 (has links)
Heidelberg, Univ., Diss., 2005.
30

Coordination of traffic signals in networks and related graph theoretical problems on spanning trees

Wünsch, Gregor January 2008 (has links)
Zugl.: Berlin, Techn. Univ., Diss., 2008

Page generated in 0.1124 seconds