101 search results - page 11 / 21 » Subrecursive functions on partial sequences |
LFCS
1992
Springer
15 years 1 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
SBACPAD
2003
IEEE
15 years 2 months ago
2003
IEEE
Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of h...
CAISE
1999
Springer
15 years 1 months ago
1999
Springer
The support of process enactment through the use of workflow management systems has gained considerable attention within the last few years. We develop a classification framework c...
BMCBI
2010
14 years 7 months ago
2010
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
107
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...