Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=3448

• An external partial permutations memory for ant colony optimization
  Adnan Acan
  Lecture Notes in Computer Science 3448, 2005, pp. 1-11
• A novel application of evolutionary computing in process systems engineering
  Jessica Andrea Carballido, Ignacio Ponzoni, Nélida Beatriz Brignole
  Lecture Notes in Computer Science 3448, 2005, pp. 12-22
• Choosing the fittest subset of low level heuristics in a hyperheuristic framework
  Konstantin Chakhlevitch, Peter Cowling
  Lecture Notes in Computer Science 3448, 2005, pp. 23-33
• An attribute grammar decoder for the 01 MultiConstrained knapsack problem
  Robert Cleary, Michael O'Neill
  Lecture Notes in Computer Science 3448, 2005, pp. 34-45
• EvoGeneS, a new evolutionary approach to graph generation
  Luigi Pietro Cordella, Claudio de Stefano, Francesco Fontanella, Angelo Marcelli
  Lecture Notes in Computer Science 3448, 2005, pp. 46-57
• On the application of evolutionary algorithms to the consensus tree problem
  Carlos Cotta
  Lecture Notes in Computer Science 3448, 2005, pp. 58-67
• Analyzing fitness landscapes for the optimal Golomb Ruler Problem
  Carlos Cotta, Antonio J. Fernández
  Lecture Notes in Computer Science 3448, 2005, pp. 68-79
• Immune algorithms with aging operators for the string folding problem and the protein folding problem
  V. Cutello, G. Morelli, G. Nicosia, M. Pavone
  Lecture Notes in Computer Science 3448, 2005, pp. 80-90
• Multiobjective quadratic assignment problem solved by an explicit building block search algorithm - MOMGA-IIa
  Richard O. Day, Gary B. Lamont
  Lecture Notes in Computer Science 3448, 2005, pp. 91-100
• Lot-sizing in a foundry using genetic algorithm and repair functions
  Jerzy Duda
  Lecture Notes in Computer Science 3448, 2005, pp. 101-111
• Estimation of distribution algorithms with mutation
  Hisashi Handa
  Lecture Notes in Computer Science 3448, 2005, pp. 112-121
• Property analysis of symmetric Travelling Salesman Problem instances acquired through evolution
  Jano I. van Hemert
  Lecture Notes in Computer Science 3448, 2005, pp. 122-131
• Heuristic colour assignment strategies for merge models in graph colouring
  István Juhos, Attila Tóth, Jano I. van Hemert
  Lecture Notes in Computer Science 3448, 2005, pp. 132-143
• Application of the grouping genetic algorithm to university course timetabling
  Rhydian Lewis, Ben Paechter
  Lecture Notes in Computer Science 3448, 2005, pp. 144-153
• Self-adapting evolutionary parameters: Encoding aspects for combinatorial optimization problems
  Marcos H. Maruo, Heitor S. Lopes, Myriam R. Delgado
  Lecture Notes in Computer Science 3448, 2005, pp. 154-165
• Population training heuristics
  Alexandre C.M. Oliveira, Luiz A.N. Lorena
  Lecture Notes in Computer Science 3448, 2005, pp. 166-176
• Scatter search particle filter to solve the dynamic Travelling Salesman Problem
  Juan José Pantrigo, Abraham Duarte, Ángel Sánchez, Ral Cabido
  Lecture Notes in Computer Science 3448, 2005, pp. 177-189
• The use of meta-heuristics to solve economic lot scheduling problem
  Syed Asif Raza, Ali Akgunduz
  Lecture Notes in Computer Science 3448, 2005, pp. 190-201
• Making the edge-set encoding fly by controlling the bias of its crossover operator
  Franz Rothlauf, Carsten Tzschoppe
  Lecture Notes in Computer Science 3448, 2005, pp. 202-212
• Ant algorithm for the graph matching problem
  Olfa Sammoud, Christine Solnon, Khaled Ghédira
  Lecture Notes in Computer Science 3448, 2005, pp. 213-223
• An adaptive genetic algorithm for the minimal switching graph problem
  Maolin Tang
  Lecture Notes in Computer Science 3448, 2005, pp. 224-233
• An improved simulated annealing method for the combinatorial sub-problem of the profit-based unit commitment problem
  T. Aruldoss Albert Victoire, A. Ebenezer Jeyakumar
  Lecture Notes in Computer Science 3448, 2005, pp. 234-245
• A new hybrid GA/SA algorithm for the job shop scheduling problem
  Chaoyong Zhang, Peigen Li, Yunqing Rao, Shuxia Li
  Lecture Notes in Computer Science 3448, 2005, pp. 246-259
• An agent model for binary constraint satisfaction problems
  Weicai Zhong, Jing Liu, Licheng Jiao
  Lecture Notes in Computer Science 3448, 2005, pp. 260-269