231 search results - page 5 / 47 » Two lower bounds for self-assemblies at temperature 1 |
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
— In this work, coding for the relay channel (RC) and the cooperative relay broadcast channel (RBC) controlled by random parameters are studied. In the first channel, the RC, in...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
105
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...