28 search results - page 4 / 6 » Constructions and bounds for (m, t)-splitting systems |
75
Voted
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
110
Voted
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
Real-time systems have reached a level of complexity beyond the scaling capability of the low-level or restricted languages traditionally used for real-time programming. While Met...
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
121
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
83
Voted
SIAMSC
2010
14 years 8 months ago
2010
For the finite volume discretization of a second-order elliptic model problem, we derive a posteriori error estimates which take into account an inexact solution of the associated...