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

### From inside the book

Results 1-3 of 79

Page 498

Because we are only interested in the set of

as bit strings, we also restrict our attention to a special set of discretized

whose domain are the integers 0 to 2L — 1 and hence can be represented ...

Because we are only interested in the set of

**functions**which can be representedas bit strings, we also restrict our attention to a special set of discretized

**functions**whose domain are the integers 0 to 2L — 1 and hence can be represented ...

Page 501

Q Let C(G, FQ) be the count of all optima in the Hamming neighborhood of Gray

representations of

Gray representations of

...

Q Let C(G, FQ) be the count of all optima in the Hamming neighborhood of Gray

representations of

**functions**in FQ. Let C(G, FQ) be the count of all optima in theGray representations of

**functions**in FQ. Let C{B, FQ) be the count of all optima in...

Page 735

A valve

incurred over time using various kinds of models. Typically, the value

additive over time and based on expectations, e.g. the

...

A valve

**function**represents (quantifies) control objectives by combining rewardsincurred over time using various kinds of models. Typically, the value

**function**isadditive over time and based on expectations, e.g. the

**function**often uses a finite...

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