Sciweavers

1662 search results - page 35 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
14 years 1 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
ATAL
1999
Springer
13 years 12 months ago
Towards a Distributed, Environment-Centered Agent Framework
Abstract. This paper will discuss the internal architecture for an agent framework called DECAF (Distributed Environment Centered Agent Framework). DECAF is a software toolkit for ...
John R. Graham, Keith Decker
ICRA
2007
IEEE
128views Robotics» more  ICRA 2007»
14 years 1 months ago
Adaptive Play Q-Learning with Initial Heuristic Approximation
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
Andriy Burkov, Brahim Chaib-draa
ATAL
2008
Springer
13 years 9 months ago
The design of a generic framework for integrating ECA components
Embodied Conversational Agents (ECAs) are life-like computer generated characters that interact with human users in face-to-face multi-modal conversations. ECA systems are general...
Hung-Hsuan Huang, Toyoaki Nishida, Aleksandra Cere...
ICAART
2010
INSTICC
14 years 4 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis