( en | de | ru )

 

Disambiguation of "Ross, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
A hyper-heuristic for solving one and two-dimensional bin packing problems.

, , and . GECCO (Companion), page 257-258. ACM, (2011)

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.

Peter Röss

Peter Ross

Heinz-Peter Ross

Peter-Helmut Ross

Peter Ross Bedford

 

Other publications of authors with the same name

Design of Edinburgh logo., and . Microprocess. Microsystems, 8 (3): 119-123 (1984)An Adaptive Agent Based Economic Model., and . Learning Classifier Systems, volume 1813 of Lecture Notes in Computer Science, page 263-282. Springer, (1999)Some Combinatorial Landscapes on which a Genetic Algorithm Outperforms Other Stochastic Iterative Methods., and . Evolutionary Computing, AISB Workshop, volume 993 of Lecture Notes in Computer Science, page 1-13. Springer, (1995)Fast Practical Evolutionary Timetabling., , and . Evolutionary Computing, AISB Workshop, volume 865 of Lecture Notes in Computer Science, page 250-263. Springer, (1994)The MAX Problem for Genetic Programming - Highlighting an Adverse Interaction between the Crossover Operator and a Restriction on Tree Depth, and . Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, UK, (1995)A neuro-evolutionary approach to produce general hyper-heuristics for the dynamic variable ordering in hard binary constraint satisfaction problems., , , , and . GECCO, page 1811-1812. ACM, (2009)A hyper-heuristic for solving one and two-dimensional bin packing problems., , and . GECCO (Companion), page 257-258. ACM, (2011)Application of the hardness theory when solving the timetabling problem with genetic algorithms., , and . CEC, page 604-611. IEEE, (1999)Using Hyper-heuristics for the Dynamic Variable Ordering in Binary Constraint Satisfaction Problems., , , and . MICAI, volume 5317 of Lecture Notes in Computer Science, page 407-417. Springer, (2008)A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem., , , and . GECCO, page 591-598. ACM, (2006)