## Proceedings of the ... National Conference on Artificial Intelligence, Volume 14 |

### From inside the book

Results 1-3 of 80

Page 212

The

INPUTS. We refer to this

whereas the "output

The

**complexity**of line 12 is therefore the same as the**complexity**of COMBINE-INPUTS. We refer to this

**complexity**as the "input**complexity**" for the subgraph,whereas the "output

**complexity**" is the number of combinations returned by ...Page 214

HG was able to process all of the problems. This, in itself, is a significant step

forward, as problems of such

performed significantly better than Tsang's algorithm for every problem

considered.

HG was able to process all of the problems. This, in itself, is a significant step

forward, as problems of such

**complexity**have been intractable up until now. HGperformed significantly better than Tsang's algorithm for every problem

considered.

Page 235

The time

formulation depends strongly on the fact that two activities cannot co-occur. It is

difficult, therefore, to see how JointHeight can be efficiently extended to more

complex ...

The time

**complexity**at a single search state is 0(w«3) (see below). 2. Theformulation depends strongly on the fact that two activities cannot co-occur. It is

difficult, therefore, to see how JointHeight can be efficiently extended to more

complex ...

### 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