10805 search results - page 354 / 2161 » Mapping Computation with No Memory |
135
click to vote
CRYPTO
2003
Springer
16 years 12 hour ago
2003
Springer
In 1992, Dwork and Naor proposed that e-mail messages be accompanied by easy-to-check proofs of computational effort in order to discourage junk e-mail, now known as spam. They pro...
192
click to vote
DEXA
1994
Springer
15 years 11 months ago
1994
Springer
We present the PPOST-architecture (Persistent Parallel Object Store) for main-memory database systems on parallel computers, that is suited for applications with challenging perfor...
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents the architecture and characteristics of a memory database intended to be used as a cache engine for web applications. Primary goals of this database are speed a...
175
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
189
click to vote
HPCA
2003
IEEE
16 years 7 months ago
2003
IEEE
A challenging issue in today's server systems is to transparently deal with failures and application-imposed requirements for continuous operation. In this paper we address t...