Sciweavers

334 search results - page 33 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
ISLPED
1999
ACM
91views Hardware» more  ISLPED 1999»
15 years 2 months ago
Stochastic modeling of a power-managed system: construction and optimization
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...
Qinru Qiu, Qing Wu, Massoud Pedram
AIPS
2007
14 years 12 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
TAPSOFT
1995
Springer
15 years 1 months ago
Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
Hanne Riis Nielson, Flemming Nielson
AAAI
2010
14 years 11 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
NIPS
1993
14 years 11 months ago
The Power of Amnesia
We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scal...
Dana Ron, Yoram Singer, Naftali Tishby