2218 search results - page 42 / 444 » Testing Expressibility Is Hard |
PTS
2010
13 years 5 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
PRICAI
1998
Springer
13 years 12 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This study investigates automatic regular expression generation using Grammatical Evolution. The software implementation is based on a subset of POSIX regular expression rules. Fo...
GCB
2005
Springer
14 years 1 months ago
2005
Springer
: In most studies concerning expression data analyses information on the variability of gene intensity across samples is usually exploited. This information is sensitive to initial...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
For many decades automatic facial expression recognition has scientifically been considered a real challenging problem in the fields of pattern recognition or robotic vision. The ...