Sciweavers

316 search results - page 3 / 64
» Genomic computing networks learn complex POMDPs
Sort
View
ACL
2010
13 years 4 months ago
Towards Relational POMDPs for Adaptive Dialogue Management
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
Pierre Lison
AIPS
2008
13 years 8 months ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu
ICANN
2007
Springer
14 years 12 days ago
Incremental One-Class Learning with Bounded Computational Complexity
Rowland R. Sillito, Robert B. Fisher
FOCI
2007
IEEE
14 years 17 days ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang
JIB
2006
220views more  JIB 2006»
13 years 6 months ago
An assessment of machine and statistical learning approaches to inferring networks of protein-protein interactions
Protein-protein interactions (PPI) play a key role in many biological systems. Over the past few years, an explosion in availability of functional biological data obtained from hi...
Fiona Browne, Haiying Wang, Huiru Zheng, Francisco...