## Proceedings of the ... National Conference on Artificial Intelligence, Volume 14American Association for Artificial Intelligence, 1997 - Artificial intelligence |

### From inside the book

Results 1-3 of 72

Page 143

qcs-plane is shaded. starting point of the trajectory. Because the trajectory is

monotonic, it will remain entirely in one quadrant of the new coordinate system;

we ...

**Figure**7: Trajectory in qc-space (thick arrow) is diagonal. The active region of theqcs-plane is shaded. starting point of the trajectory. Because the trajectory is

monotonic, it will remain entirely in one quadrant of the new coordinate system;

we ...

Page 210

Stapl U'4»4 = 25« Step3 4

subgraph optimization.

for each possible value of the vertex with constraints outside the subgraph, ...

Stapl U'4»4 = 25« Step3 4

**Figure**4: Solution Synthesis**Figure**2: Three steps forsubgraph optimization.

**Figure**3: Subgraph: maximize the number of reds. nally,for each possible value of the vertex with constraints outside the subgraph, ...

Page 342

0-4^ 0 20 40 60 80 100 120 140 160 180 200 400 0 "J -^^TyTTTTtjmTTmTpf^ 0

20 40 60 80 100 120 140 160 180 200

distribution obtained while traversing the phase transition with n fixed at 200. The

legend ...

0-4^ 0 20 40 60 80 100 120 140 160 180 200 400 0 "J -^^TyTTTTtjmTTmTpf^ 0

20 40 60 80 100 120 140 160 180 200

**Figure**2: Histograms of the UPI-distribution obtained while traversing the phase transition with n fixed at 200. The

legend ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Agent Architecture | 3 |

Agent Coordination | 16 |

Negotiation | 29 |

Copyright | |

48 other sections not shown

### Other editions - View all

### Common terms and phrases

3SAT Abstract action agents algorithm allocation applied approach arc-consistency Artificial Intelligence assignment axioms Bayesian network behavior causal CBASlack chatter clauses coloring complexity component constraint satisfaction constraint satisfaction problems context dataset decision defined denoted described description logic distribution document domain dynamic emotion evaluation example expected value Figure formula function goal graph graph coloring GSAT heuristic commitments inference input literals local search logic Logic Programming method minimal node operators optimal paper parameters performance phase transition planning possible post-failure prob probability problem instances Proc procedure propagation qualitative quasigroup query plan random reasoning representation Research resource retrievable query robot robustness rule rule-base satisfied scheduling Selman semantics sequence servers simulation solution solve source-complete spatial specific strategies structure subgraph suffix tree SumHeight techniques temporal Theorem theory tion tree University unsatisfiable variables WSAT www.aaai.org