2774 search results - page 254 / 555 » Query-Driven Program Testing |
166
Voted
AAECC
1999
Springer
15 years 6 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
148
click to vote
TCC
2010
Springer
15 years 4 months ago
2010
Springer
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
156
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Abstract-- This paper describes two distortion estimation techniques for object recognition that solve EZ-Gimpy and Gimpy-r, two of the visual CAPTCHAs ("Completely Automated ...
178
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
192
click to vote
UM
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. In this paper we describe an Integrated Development System for Instructional Model for E-learning (INDESIME) to create and to maintain instructional models using adaptive...