46 search results - page 8 / 10 » Permuted Longest-Common-Prefix Array |
PACT
2005
Springer
14 years 5 days ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
SC
1994
ACM
13 years 10 months ago
1994
ACM
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions e.g. Ani+j, where 0 j n. In this paper, we describe a d...
CATS
2006
13 years 8 months ago
2006
Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to pr...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the p...
TC
2011
13 years 1 months ago
2011
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...