17329 search results - page 3036 / 3466 » Improved non-approximability results |
215
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
181
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the c...
173
click to vote
ECCC
2006
15 years 7 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
168
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist o...
222
click to vote
BMCBI
2007
15 years 7 months ago
2007
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...