- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
X, 311 S.
- Sprache
-
Deutsch
- Anmerkungen
-
graph. Darst.
Darmstadt, Techn. Univ., Habil.-Schr.
- Erschienen in
-
Habilitationsschrift ; Teil 2
- Klassifikation
-
Informatik
Mathematik
- Schlagwort
-
Kombinatorische Optimierung
Ameisenalgorithmus
- Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:32 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Constructing Subtests Using Ant Colony Optimization
Long-term open-pit planning by ant colony optimization
Ant colony optimization for parallel test assembly
Ant colony optimization on runtime reconfigurable architectures
Ant colony optimization for resource-constrained project scheduling
Analysis and design of ant colony optimization algorithms for vehicle routing problems
Efficient ant colony optimization algorithms for structure and ligand-based drug design
Ant colony optimization based inverse folding of mono- and bistable RNA macromolecules
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Runtime analysis of a simple ant colony optimization algorithm
Ant colony optimization and the minimum spanning tree problem
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Constructing Subtests Using Ant Colony Optimization
Long-term open-pit planning by ant colony optimization
Ant colony optimization for parallel test assembly
Ant colony optimization on runtime reconfigurable architectures
Ant colony optimization for resource-constrained project scheduling
Analysis and design of ant colony optimization algorithms for vehicle routing problems
Efficient ant colony optimization algorithms for structure and ligand-based drug design
Ant colony optimization based inverse folding of mono- and bistable RNA macromolecules
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Runtime analysis of a simple ant colony optimization algorithm
Ant colony optimization and the minimum spanning tree problem
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Constructing Subtests Using Ant Colony Optimization
Long-term open-pit planning by ant colony optimization
Ant colony optimization for parallel test assembly
Ant colony optimization on runtime reconfigurable architectures
Ant colony optimization for resource-constrained project scheduling
Analysis and design of ant colony optimization algorithms for vehicle routing problems
Efficient ant colony optimization algorithms for structure and ligand-based drug design
Ant colony optimization based inverse folding of mono- and bistable RNA macromolecules
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Runtime analysis of a simple ant colony optimization algorithm
Ant colony optimization and the minimum spanning tree problem