171 search results - page 9 / 35 » What's Decidable about Sequences |
159
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
116
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
111
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
133
Voted
CHI
2007
ACM
16 years 4 months ago
2007
ACM
We are developing a computer system which provides information about babies in neonatal intensive care to family members and friends. A key challenge is deciding what information ...
151
Voted
AAAI
1998
15 years 5 months ago
1998
One of the most important problems for an intelligent tutoring system is deciding how to respond when a student asks for help. Responding cooperatively requires an understanding o...