2252 search results - page 346 / 451 » Lower Bounds for Dynamic Algorithms |
113
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
126
Voted
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
119
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
132
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
150
click to vote
DBPL
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...