Spelling suggestions: "subject:"kombinatorische abbauoptimierung"" "subject:"kombinatorische ablaufoptimierung""
21 |
Parallelization strategies for the ant systemBullnheimer, 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 perspectiveBirattari, 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 ProblemeBartodziej, Paul January 2009 (has links)
Zugl.: Köln, Univ., Diss., 2009
|
26 |
Standortplanung von BahnhöfenMecke, Steffen. January 2003 (has links)
Konstanz, Univ., Diplomarb., 2003.
|
27 |
Convex Mathematical Programs for Relational Matching of Object ViewsSchellewald, Christian. January 2005 (has links)
Mannheim, Univ., Diss., 2004.
|
28 |
Image partitioning based on semidefinite programmingKeuchel, Jens. January 2004 (has links)
Mannheim, Univ., Diss., 2004.
|
29 |
Polyhedra and algorithms for the general routing problemTheis, Dirk Oliver. January 2005 (has links)
Heidelberg, Univ., Diss., 2005.
|
30 |
Coordination of traffic signals in networks and related graph theoretical problems on spanning treesWünsch, Gregor January 2008 (has links)
Zugl.: Berlin, Techn. Univ., Diss., 2008
|
Page generated in 0.1217 seconds