Sciweavers

1355 search results - page 62 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
ISAAC
2010
Springer
221views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin...
RTAS
2005
IEEE
14 years 1 months ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
ENTCS
2007
134views more  ENTCS 2007»
13 years 7 months ago
A Compact Linear Translation for Bounded Model Checking
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
Paul B. Jackson, Daniel Sheridan
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
11 years 10 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
WG
2007
Springer
14 years 1 months ago
Characterization and Recognition of Digraphs of Bounded Kelly-width
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
Daniel Meister, Jan Arne Telle, Martin Vatshelle