362 search results - page 21 / 73 » A Theory of Probabilistic Functional Testing |
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
ICSE
2001
IEEE-ACM
15 years 4 months ago
2001
IEEE-ACM
We present a foundational theory of software system reliability based on components. The theory describes how component developers can design and test their components to produce ...
115
click to vote
NIPS
2000
15 years 1 months ago
2000
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, a new model of Probabilistic Model-Building Genetic Algorithms (PMBGAs), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design var...