### Table 2. Complexity Classes of Resource Allocation, n = size of task set #02, m = size of operation set #0A

"... In PAGE 14: ... We define different categories of difficulties of the problem and present complexity results for them. Table2 summarizes these complexity results. To address these formalized problems, we define the notion of Dynamic Distributed Constraint Satisfaction Problem (DyDCSP) and present a generalized mapping from distributed resource allocation to DyDCSP.... ..."

### Table 3: Solution of a constraint satisfaction problem by branching, domain reduction, relaxation, and cutting plane generation.

"... In PAGE 7: ... Because the relaxation is distinguished from the model, both are more succinct. A search tree appears in Table3 . At each node constraint propagation is rst applied to the... ..."

### Table 5.3: Number of consistency checks performed by various backtracking algo- rithms on certain constraint satisfaction problems.

### Table 2. Parameters and models used in some previous studies of random constraint satisfaction problems.

### Table 1: Basic concepts in model-based diagnosis and over-determined constraint satisfaction problems. Except for observations and domain of variables the concepts in model-based diagnosis and over-determined constraint satisfaction problems are quite similar.

1993

"... In PAGE 2: ... 2.3 Analogy between OCSPs and MBD The basic concepts in model-based diagnosis and over- determined constraint satisfaction problems are summarized in Table1 . Components and constraints are quite similar, as is the notion of connections, weights, and likely diagnoses and low weighted overruled constraints.... ..."

Cited by 24

### Table I: Basic concepts in model-based diagnosis and over-determined constraint satisfaction problems. Except for observations and domain of variables the concepts in model-based diagnosis and over-determined constraint satisfaction problems are quite similar.

1993

Cited by 24

### Table 2: Specification of a simple constraint satisfaction prob- lem. The weights indicate that constraint c2 is most important and constraint c4 is least important.

1993

"... In PAGE 4: ...4 A simple example We will illustrate DOC by a simple example. Consider the con- straint satisfaction problem specified in Table2 . The weight are integers between 1 and 10 in which 10 is regarded as most important.... ..."

Cited by 24

### Table 1: Characteristics of Distributed Constraint Optimization Methods Method Asynch? Optimal? Dist? Satisfaction-Based Search[16][11] N N Y

2005

"... In PAGE 27: ... 8.2 Distributed Constraint Optimization Table1 outlines the state of the art in existing approaches to DCOP. Methods are parame- terized by communication model (asynchronous or synchronous), completeness (guaranteed optimal solutions for DCOP), and distributedness .... ..."

Cited by 81