Sciweavers

297 search results - page 37 / 60
» J-MADeM, a market-based model for complex decision problems
Sort
View
AAAI
2006
13 years 10 months ago
Using Homomorphisms to Transfer Options across Continuous Reinforcement Learning Domains
We examine the problem of Transfer in Reinforcement Learning and present a method to utilize knowledge acquired in one Markov Decision Process (MDP) to bootstrap learning in a mor...
Vishal Soni, Satinder P. Singh
ACL
2010
13 years 6 months ago
Towards Relational POMDPs for Adaptive Dialogue Management
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
Pierre Lison
IJCAI
2003
13 years 10 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
INFOCOM
2012
IEEE
11 years 11 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 2 months ago
Harmony search for structural design
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
Zong Woo Geem, Kang Seok Lee, Chung-Li Tseng