Sciweavers

191 search results - page 37 / 39
» Real-Time Symbolic Dynamic Programming
Sort
View
AIPS
2007
13 years 9 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
CMSB
2008
Springer
13 years 9 months ago
Analyzing a Discrete Model of Aplysia Central Pattern Generator
We present a discrete formal model of the central pattern generator (CPG) located in the buccal ganglia of Aplysia that is responsible for mediating the rhythmic movements of its f...
Ashish Tiwari, Carolyn L. Talcott
AAAI
2010
13 years 9 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
SIGSOFT
2009
ACM
14 years 2 months ago
MSeqGen: object-oriented unit-test generation via mining source code
An objective of unit testing is to achieve high structural coverage of the code under test. Achieving high structural coverage of object-oriented code requires desirable method-ca...
Suresh Thummalapenta, Tao Xie, Nikolai Tillmann, J...