2875 search results - page 48 / 575 » Distributed Reactive Machines |
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
74
Voted
PVM
2004
Springer
15 years 6 months ago
2004
Springer
123
click to vote
COLT
2008
Springer
15 years 2 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
109
Voted
SEFM
2005
IEEE
15 years 6 months ago
2005
IEEE
The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of ...