2218 search results - page 14 / 444 » Testing Expressibility Is Hard |
154
click to vote
EUROCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
138
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
121
Voted
SIGMETRICS
2006
ACM
15 years 11 months ago
2006
ACM
In this paper, we present a new metric, Hard-Fault Architectural Vulnerability Factor (H-AVF), to allow designers to more effectively compare alternate hard-fault tolerance scheme...
155
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
177
click to vote
FIDJI
2003
Springer
15 years 10 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...