1632 search results - page 75 / 327 » Sublinear Time Algorithms for Metric Space Problems |
181
Voted
PROMISE
2010
14 years 10 months ago
2010
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
122
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
118
Voted
JMLR
2010
14 years 10 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
124
Voted
IJCGA
2010
15 years 23 days ago
2010
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
133
Voted
CSCLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...