10805 search results - page 1989 / 2161 » Mapping Computation with No Memory |
165
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
149
click to vote
ANCS
2007
ACM
15 years 8 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
117
click to vote
CHINZ
2007
ACM
15 years 8 months ago
2007
ACM
Research has been done into improving the means by which we organise and manage information. The usefulness of 2D versus 3D interfaces and environments has also been debated and e...
128
click to vote
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract--Much of modern software development consists of assembling together existing software components and writing the glue code that integrates them into a unified application...
119
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
Wait-freedom and obstruction-freedom have received a lot of attention in the literature. These are symmetric progress conditions in the sense that they consider all processes as b...