Sciweavers

523 search results - page 4 / 105
» Structured Solution Methods for Non-Markovian Decision Proce...
Sort
View
BMCBI
2008
136views more  BMCBI 2008»
13 years 8 months ago
An efficient method for the prediction of deleterious multiple-point mutations in the secondary structure of RNAs using suboptim
Background: RNAmute is an interactive Java application which, given an RNA sequence, calculates the secondary structure of all single point mutations and organizes them into categ...
Alexander Churkin, Danny Barash
ICML
2006
IEEE
14 years 9 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
AIPS
2009
13 years 9 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
CP
1998
Springer
14 years 23 days ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow