2218 search results - page 117 / 444 » Testing Expressibility Is Hard |
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
VTS
2003
IEEE
14 years 2 months ago
2003
IEEE
Reseeding is used to improve fault coverage in pseudo-random testing. Most of the work done on reseeding is based on storing the seeds in an external tester. Besides its high cost...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— We propose an asynchronous island-model algorithm distribution framework and test the popular Differential Evolution algorithm performance when a few processors are ava...
LICS
1999
IEEE
14 years 1 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
CHI
2004
ACM
14 years 9 months ago
2004
ACM
This paper describes the concepts of TEA, a flexible tool that supports user tests by automating repetitive tasks and collecting data of user inputs and actions. TEA was specifica...