PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Pelikan, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Edge histogram based sampling with local search for solving permutation problems.

, , and . Int. J. Hybrid Intell. Syst., 3 (1): 11-22 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Martin Baumann

Martin Schwartz University of Stuttgart

Martin Alvarez University of Stuttgart

Univ. -Prof. Martin Ostermann University of Stuttgart

Dr. Martin Rose University of Stuttgart

 

Other publications of authors with the same name

Edge histogram based sampling with local search for solving permutation problems., , and . Int. J. Hybrid Intell. Syst., 3 (1): 11-22 (2006)Efficiency Enhancement of Estimation of Distribution Algorithms., , and . Scalable Optimization via Probabilistic Modeling, volume 33 of Studies in Computational Intelligence, Springer, (2006)Parameter-less Hierarchical Bayesian Optimization Algorithm., , and . Parameter Setting in Evolutionary Algorithms, volume 54 of Studies in Computational Intelligence, Springer, (2007)Probabilistic model-building genetic algorithms.. GECCO (Companion), page 2303-2330. ACM, (2010)Probabilistic model-building genetic algorithms.. GECCO (Companion), page 913-940. ACM, (2011)Probabilistic model-building genetic algorithms.. GECCO (Companion), page 2389-2416. ACM, (2008)Distance-based bias in model-directed optimization of additively decomposable problems., and . GECCO, page 273-280. ACM, (2012)Order or not: does parallelization of model building in hBOA affect its scalability?, and . GECCO, page 555-561. ACM, (2007)From mating pool distributions to model overfitting., , and . GECCO, page 431-438. ACM, (2008)Hybrid evolutionary algorithms on minimum vertex cover for random graphs., , and . GECCO, page 547-554. ACM, (2007)