129 search results - page 4 / 26 » Uniform deterministic dictionaries |
134
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
141
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
123
click to vote
EWRL
2008
15 years 5 months ago
2008
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
155
Voted
TC
2002
15 years 3 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
113
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...