1450 search results - page 161 / 290 » On the Complexity of Hardness Amplification |
ILP
2003
Springer
14 years 2 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
ICSE
2010
IEEE-ACM
14 years 2 months ago
2010
IEEE-ACM
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
KR
2010
Springer
14 years 2 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We propose an asynchronous island-model algorithm distribution framework and test the popular Differential Evolution algorithm performance when a few processors are ava...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...