Sciweavers

1290 search results - page 10 / 258
» New algorithms of the Q-learning type
Sort
View
BMCBI
2008
123views more  BMCBI 2008»
13 years 8 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
AAECC
2004
Springer
100views Algorithms» more  AAECC 2004»
13 years 8 months ago
Convolutional Codes of Goppa Type
A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particul...
J. A. Domínguez Pérez, J. M. Mu&ntil...
POPL
1991
ACM
14 years 2 days ago
Polymorphic Type Inference and Assignment
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
Xavier Leroy, Pierre Weis
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 2 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
ANSS
2006
IEEE
14 years 2 months ago
A New Approach for Computing Conditional Probabilities of General Stochastic Processes
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
Fabian Wickborn, Claudia Isensee, Thomas Simon, Sa...