𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of agent design problems: Determinism and history dependence

✍ Scribed by Michael Wooldridge; Paul E. Dunne

Book ID
106342991
Publisher
Springer Netherlands
Year
2005
Tongue
English
Weight
334 KB
Volume
45
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The computational complexity of scenario
The computational complexity of scenario-based agent verification and design
✍ Yves Bontemps; Pierre-Yves Schobbens πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 405 KB

We first advocate that the AUML (Agent Unified Modeling Language) notation, even in its new version, is not precise enough to adequately describe protocols. This problem was long identified by Harel and we propose to follow his solution: extend sequence diagrams with a "prechart", i.e. single out th

The complexity of achievement and mainte
The complexity of achievement and maintenance problems in agent-based systems
✍ Iain A. Stewart πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 167 KB

We completely classify the computational complexity of the basic achievement and maintenance agent design problems in bounded environments when these problems are parameterized by the number of environment states and the number of agent actions. The different problems are P-complete, NP-complete, co

Solute polarization and the design of co
Solute polarization and the design of cobalt complexes as redox-active therapeutic agents
✍ Jian Hui Wu; Peter J. Winn; GyΓΆrgy G. Ferenczy; Christopher A. Reynolds πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 204 KB

A combination of quantum mechanical density functional calculations and the Poisson᎐Boltzmann continuum method has been used to calculate the electrode w Ž . x 3qr2q w Ž . x 3qr2q w Ž . x 3yr4y potential of Co en , Co NH , and Co C O relative to that of 2 3 2 2 4 3 w Ž . x 3qr2q Ž . Co dien . Excell