4565 search results - page 490 / 913 » Time Optimal Self-Stabilizing Algorithms |
126
click to vote
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
151
click to vote
EOR
2007
15 years 4 months ago
2007
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
119
click to vote
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
114
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
110
Voted
SWAT
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...