Sciweavers

271 search results - page 8 / 55
» Identifying Optimal Sequential Decisions
Sort
View
ICANN
2009
Springer
14 years 3 months ago
Measuring and Optimizing Behavioral Complexity for Evolutionary Reinforcement Learning
Model complexity is key concern to any artificial learning system due its critical impact on generalization. However, EC research has only focused phenotype structural complexity ...
Faustino J. Gomez, Julian Togelius, Jürgen Sc...
JCP
2007
143views more  JCP 2007»
13 years 8 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
AMAI
2004
Springer
14 years 2 months ago
A Framework for Sequential Planning in Multi-Agent Settings
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
Piotr J. Gmytrasiewicz, Prashant Doshi
MAGS
2010
153views more  MAGS 2010»
13 years 3 months ago
Designing bidding strategies in sequential auctions for risk averse agents
Designing efficient bidding strategies for sequential auctions remains an important, open problem area in agent-mediated electronic markets. In existing literature, a variety of bi...
Valentin Robu, Han La Poutré
ASPDAC
2007
ACM
105views Hardware» more  ASPDAC 2007»
14 years 1 months ago
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim