2467 search results - page 400 / 494 » Finite State Machines |
168
click to vote
AIED
2009
Springer
16 years 4 days ago
2009
Springer
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
167
click to vote
LPKR
1997
Springer
15 years 9 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
177
click to vote
CONCUR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
157
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background The use of clustering methods for the discovery of cancer subtypes has drawn a great deal of attention in the scientific community. While bioinformaticians have propose...
160
click to vote
ECCC
2008
15 years 5 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...