Michael Sampels

According to our database1, Michael Sampels authored at least 17 papers between 1996 and 2006.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Editorial.
J. Math. Model. Algorithms, 2006

2004
An Ant Colony Optimization Algorithm for Shop Scheduling Problems.
J. Math. Model. Algorithms, 2004

Vertex-symmetric generalized Moore graphs.
Discret. Appl. Math., 2004

2003
On Generalized Moore Digraphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art.
Proceedings of the Applications of Evolutionary Computing, 2003

2002
Metaheuristics for Group Shop Scheduling.
Proceedings of the Parallel Problem Solving from Nature, 2002

When Model Bias Is Stronger than Selection Pressure.
Proceedings of the Parallel Problem Solving from Nature, 2002

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

On A Particularity In Model-based Search.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

A MAX-MIN Ant System for the University Course Timetabling Problem.
Proceedings of the Ant Algorithms, Third International Workshop, 2002

2001
Visualization of Automorphisms and Vertex-Symmetry.
Proceedings of the Parallel Processing and Applied Mathematics, 2001

1999
Symmetric Interconnection Networks in the Design of Switches for WANs and LANs.
Proceedings of the MMB '99, 1999

1998
Algebraische Konstruktion effizienter Verbindungsnetzwerke.
Logos Verlag, ISBN: 978-3-89722-051-5, 1998

1997
Large Networks with Small Diameter.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Massively parallel architectures and systolic communication.
Proceedings of the Fifth Euromicro Workshop on Parallel and Distributed Processing (PDP '97), 1997

1996
Cayley Graphs as Interconnection Networks: A Case Study.
Proceedings of the Parcella 1996, 1996


  Loading...