Subject: 1.2.6 Computational/complexity issues of agency

 
EPrints.org
Agentlink Clearinghouse is powered by GNU EPrints developed by the School of Electronics and Computer Science of the University of Southampton.

Number of items: 15.

[Course] Dix, Jurgen (2005) Multi-Agent Systems.

Dovier, A. and Piazza, C. and Policriti, A. (2004) An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science, 311 (1-3). pp. 221-256.

Monostori, L. (2003) AI and machine learning techniques for managing complexity, changes and uncertainties in manufacturing. Engineering Applications of Artificial Intelligence, 16 (4). pp. 277-291.

Dash, R.K. and Parkes, D. and Jennings, N.R. (2003) Computational mechanism design: a call to arms. IEEE Intelligent Systems, 18 (6). pp. 40-47.

Viharos, Zs.J. and Monostori, L. and Csongrádi, Z. (2003) Realizing the digital factory: monitoring of complex production systems. Intelligent Manufacturing Systems.

Dovier, A. and Piazza, C. (2003) The Subgraph Bisimulation Problem. IEEE Transaction on Knowledge and Data Engineering, 15 (4). pp. 1055-1056.

Alkemade, F. and La Poutré, J.A. (2002) Heterogeneous Boundedly Rational Agents in the Cournot Duopoly. Heterogeneous Interacting Agents, Lecture Notes in Economics and Mathematical Systems. .

Wooldridge, M. and Dunne, P. E. (2002) The Computational Complexity of Agent Verification. In: Intelligent Agents VIII. Lecture Notes in AI. Springer-Verlag.

Dunne, P. E. and Wooldridge, M. (2002) The Computational Complexity of Boolean and Stochastic Agent Design Problems. In: Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems (AAMAS-02). , Bologna, Italy.

Bohte, S.M. and La Poutré, J.A. and Kok, J.N. (2002) Unsupervised Classification in a Layered RBF Network of Spiking Neurons. In: IEEE Transactions on Neural Networks.

Willmott, S. and Richardson, J. and Bundy, A. and Levine, J. (2001) Applying Adversarial Planning to Go. Journal of Theoretical Computer Science, 252. pp. 45-82.

Wooldridge, M. and Dunne, P. E. (2001) Optimistic and Disjunctive Agent Design Problems. In: Intelligent Agents VII. Lecture Notes in AI. Springer-Verlag.

van Bragt, D.D.B. and van Kemenade, C.H.M. and La Poutré, J.A. (2001) The Influence of Evolutionary Selection Schemes on the Iterated Prisoner Dilemma. Computational Economics. .

Negulescu, S.C. and Zamfirescu, C.B. and Barbat, B.E. (2001) User-Driven Heuristics, a Methodology for Solving Nondeterministic Problems. Acta Universitatis Cibiniensis, Technical Series E. Computer Science and Automatic Control. .

Neville, R. and Stonham, J. and Glover, R. (2000) Partially pre-calculated weights for the back propogation learning regime and high accuracy function mapping using continous input RAM based sigma-pi nets. Neural Networks: International Neural Networks Journal, 13 (1). pp. 91-110. ISSN 0893-6080

This list was generated on Mon Sep 10 17:00:29 BST 2007.

   

AgentLink is the European Commission's IST-funded Coordination Action for Agent-Based Computing
and is coordinated by the
University of Liverpool and University of Southampton
If you encounter any problems with these pages please contact web@agentlink.org.