Sciweavers

283 search results - page 37 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
BMCBI
2006
119views more  BMCBI 2006»
13 years 7 months ago
Hidden Markov Model Variants and their Application
Markov statistical methods may make it possible to develop an unsupervised learning process that can automatically identify genomic structure in prokaryotes in a comprehensive way...
Stephen Winters-Hilt
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
13 years 2 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
JMLR
2002
102views more  JMLR 2002»
13 years 7 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
TPHOL
2007
IEEE
14 years 2 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
BMCBI
2010
104views more  BMCBI 2010»
13 years 7 months ago
A method for automatically extracting infectious disease-related primers and probes from the literature
Background: Primer and probe sequences are the main components of nucleic acid-based detection systems. Biologists use primers and probes for different tasks, some related to the ...
Miguel García-Remesal, Alejandro Cuevas, Vi...