Sciweavers

74 search results - page 2 / 15
» Designing Effective Policies for Minimal Agents
Sort
View
IPPS
2000
IEEE
13 years 9 months ago
Effective Load Sharing on Heterogeneous Networks of Workstations
We consider networks of workstations which are not only timesharing, but also heterogeneous with a large variation in the computing power and memory capacities of different workst...
Li Xiao, Xiaodong Zhang, Yanxia Qu
ATAL
2008
Springer
13 years 6 months ago
Value-based observation compression for DEC-POMDPs
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
Alan Carlin, Shlomo Zilberstein
AGENTS
2001
Springer
13 years 9 months ago
Principles of intention reconsideration
We present a framework that enables a belief-desire-intention (BDI) agent to dynamically choose its intention reconsideration policy in order to perform optimally in accordance wi...
Martijn C. Schut, Michael Wooldridge
AAAI
2007
13 years 7 months ago
Temporal Difference and Policy Search Methods for Reinforcement Learning: An Empirical Comparison
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and te...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
INFOCOM
2007
IEEE
13 years 11 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi