Sciweavers

1901 search results - page 111 / 381
» Predicting Program Properties from
Sort
View
ISMB
1996
15 years 4 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
WETICE
2000
IEEE
15 years 7 months ago
Integrating XML and Object-Based Programming for Distributed Collaboration
In this paper, we explore some of the new opportunities for distributed collaborative applications that emerge from the use of XML as a data specification language. We present two...
Vassil Roussev, Prasun Dewan, Naveen Koorakula, Sr...
GECCO
2009
Springer
173views Optimization» more  GECCO 2009»
15 years 9 months ago
Creating regular expressions as mRNA motifs with GP to predict human exon splitting
Low correlation between mRNA concentrations measured at different locations for the same exon show many current Ensembl exon definitions are incomplete. Automatically created pa...
William B. Langdon, Joanna Rowsell, Andrew P. Harr...
EUROCOLT
1999
Springer
15 years 7 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 9 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...