13306 search results - page 465 / 2662 » Theoretical Computer Science |
203
click to vote
TCS
2011
15 years 2 months ago
2011
We prove that if a set X ⊆ Z2 weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then ...
205
click to vote
SOFSEM
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Smart play-out is a method for executing declarative scenariobased specifications, which utilizes powerful computation methods to compute safe supersteps, thus helping t...
198
click to vote
DIS
2008
Springer
15 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
177
click to vote
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
162
click to vote
TCS
2011
15 years 2 months ago
2011
It is a well-know fact that apparently simple systems can give rise to complex behavior. But why exactly does a given system behave in a complex manner? There are two main approac...