Filter Results:
- Full text PDF available (28)
Publication Year
1986
2019
- This year (7)
- Last 5 years (30)
- Last 10 years (53)
Publication Type
Co-author
Journals and Conferences
Learn More
- Martin C. Cooper, Thomas Schiex
- Artif. Intell.
- 2004
- Martin C. Cooper, Peter Jeavons, András Z. Salamon
- Artif. Intell.
- 2010
Article history: Received 17 August 2009 Received in revised form 13 February 2010 Accepted 24 March 2010 Available online 27 March 2010
- David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
- Artif. Intell.
- 2006
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful… (More)
- Martin C. Cooper, Simon de Givry, Martí Sánchez-Fibla, Thomas Schiex, Matthias Zytnicki, T. Werner
- Artif. Intell.
- 2010
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applications in Artificial… (More)
- Glenn W. Milligan, Martin C. Cooper
- Multivariate behavioral research
- 1986
Five external criteria were used to evaluate the extent of recovery of the true structure in a hierarchical clustering solution. This was accomplished by comparing the partitions produced by the… (More)
- Peter Jeavons, Martin C. Cooper
- Artif. Intell.
- 1995
Finding solutions to a constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph… (More)
- Peter Jeavons, David A. Cohen, Martin C. Cooper
- Artif. Intell.
- 1998
Although the constraint satisfaction problem is NP-complete in general, a number of constraint classes have been identified for which some fixed level of local consistency is sufficient to ensure… (More)
- Martin C. Cooper
- Fuzzy Sets and Systems
- 2003
In the constraint satisfaction problem (CSP) knowledge about a relation on n variables is given in the form of constraints on subsets of the variables. A solution to the CSP is simply an… (More)
- Martin C. Cooper, David A. Cohen, Peter Jeavons
- Artif. Intell.
- 1994
Finding solutions to a binary constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph… (More)
Optimizing a combination of local cost functions on discrete variables is a central problem in many formalisms such as in probabilistic networks, maximum satisfiability, weighted CSP or factor… (More)