( en | de | ru )

 

Disambiguation of "Parkes, Andrew J."

Author of the publication

copydeleteadd this publication to your clipboard
Scaling Properties of Pure Random Walk on Random 3-SAT.

. CP, volume 2470 of Lecture Notes in Computer Science, page 708-713. Springer, (2002)

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.

Andrew J Atkins

J Andrew Doole

Andrew J White

Roderick Parkes

Andrew Cato

 

Other publications of authors with the same name

Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers., , and . LION, volume 11353 of Lecture Notes in Computer Science, page 220-224. Springer, (2018)Easy Predictions for the Easy-Hard-Easy Transition.. AAAI/IAAI, page 688-694. AAAI Press / The MIT Press, (2002)Worldwide Aeronautical Route Planner., , , and . AAAI/IAAI, page 916-917. AAAI Press / The MIT Press, (1999)The Teaching Space Allocation Problem with Splitting., , , , , and . PATAT, volume 3867 of Lecture Notes in Computer Science, page 228-247. Springer, (2006)Policy matrix evolution for generation of heuristics., and . GECCO, page 2011-2018. ACM, (2011)A guide to conic optimisation and its applications., and . RAIRO Oper. Res., 52 (4): 1087-1106 (2018)Scaling Properties of Pure Random Walk on Random 3-SAT.. CP, volume 2470 of Lecture Notes in Computer Science, page 708-713. Springer, (2002)Satisfiability Algorithms and Finite Quantification., and . KR, page 690-701. Morgan Kaufmann, (2000)A genetic programming hyper-heuristic: Turning features into heuristics for constraint satisfaction., , , and . UKCI, page 183-190. IEEE, (2013)On the idea of evolving decision matrix hyper-heuristics for solving constraint satisfaction problems., , , and . GECCO (Companion), page 255-256. ACM, (2011)