5570 search results - page 499 / 1114 » Applications of Fair Testing |
203
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
240
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
166
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
175
click to vote
LREC
2010
15 years 8 months ago
2010
Since the first half of the 20th century, readability formulas have been widely employed to automatically predict the readability of an unseen text. In this article, the formulas ...
176
click to vote
FORTE
2008
15 years 8 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...