7 found
Order:
Disambiguations
Peter G. Jeavons [5]Peter Jeavons [2]
  1.  8
    Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.
  2.  5
    Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
  3.  8
    Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
  4.  6
    Characterising tractable constraints.Martin C. Cooper, David A. Cohen & Peter G. Jeavons - 1994 - Artificial Intelligence 65 (2):347-361.
  5.  7
    The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
  6.  2
    Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.Martin C. Cooper, Peter G. Jeavons & András Z. Salamon - 2010 - Artificial Intelligence 174 (9-10):570-584.
  7.  22
    The Design of Evolutionary Algorithms: A Computer Science Perspective on the Compatibility of Evolution and Design.Peter Jeavons - 2022 - Zygon 57 (4):1051-1068.
    The effectiveness of evolutionary algorithms is one of the issues discussed in The Compatibility of Evolution and Design, where it is argued that such algorithms are only effective when stringent preconditions are met. This article considers this issue from the perspective of computer science. It explores the properties of problems that can be effectively solved by evolutionary algorithms, and the extent to which such algorithms need to be carefully adjusted. Although there are important differences between the study of evolutionary algorithms (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark