Sciweavers

829 search results - page 73 / 166
» A time aggregation approach to Markov decision processes
Sort
View
AIPS
2007
15 years 8 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
AAAI
2006
15 years 7 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
GECCO
2004
Springer
15 years 11 months ago
Unveiling Optimal Operating Conditions for an Epoxy Polymerization Process Using Multi-objective Evolutionary Computation
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...
Kalyanmoy Deb, Kishalay Mitra, Rinku Dewri, Saptar...
PVLDB
2010
121views more  PVLDB 2010»
15 years 28 days ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
AVI
2008
15 years 8 months ago
The need for an interaction cost model in adaptive interfaces
The development of intelligent assistants has largely benefited from the adoption of decision-theoretic (DT) approaches that enable an agent to reason and account for the uncertai...
Bowen Hui, Sean Gustafson, Pourang Irani, Craig Bo...