4095 search results - page 160 / 819 » How to test a tree |
129
Voted
ACL
1990
15 years 1 months ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
121
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
101
Voted
ISBI
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of sequential hypothesis testing when the exact pdfs are not known but instead a set of iid samples are used to describe the hypotheses. We modify the clas...
85
Voted
XPU
2009
Springer
15 years 7 months ago
2009
Springer
We present results of a case study looking at how domain knowledge is communicated to developers using executable acceptance test driven development at a large software development...
78
Voted
DATE
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper, we present a test generation framework for testing of quantum cellular automata (QCA) circuits. QCA is a nanotechnology that has attracted significant recent at...