2877 search results - page 97 / 576 » The Complexity of Planarity Testing |
125
click to vote
VTS
1995
IEEE
15 years 7 months ago
1995
IEEE
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
148
click to vote
ERSA
2010
15 years 2 months ago
2010
SRAM-based FPGA devices are an attractive option for data processing on space-based platforms, due to high computational capabilities and a lower power envelope than traditional pr...
112
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This is the second part of a tutorial discussing the experimental protocol issues in Testing the Torah Code Hypothesis. The principal concept is the test statistic which is used t...
108
click to vote
CHI
2005
ACM
16 years 4 months ago
2005
ACM
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
133
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...