1033 search results - page 38 / 207 » The Relative History Heuristic |
102
click to vote
SIAMSC
2008
14 years 11 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given sour...
ICDE
2010
IEEE
15 years 17 hour ago
2010
IEEE
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
SC
2004
ACM
15 years 5 months ago
2004
ACM
Desktop grids are popular platforms for high throughput applications, but due their inherent resource volatility it is difficult to exploit them for applications that require rap...
104
click to vote
LION
2010
Springer
15 years 4 months ago
2010
Springer
We demonstrate a means of knowledge discovery through feature extraction that exploits the search history of an optimization run. We regress a symbolic model ensemble from optimiza...