5580 search results - page 375 / 1116 » Randomized priority algorithms |
217
click to vote
STACS
2005
Springer
16 years 23 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
191
click to vote
MSWIM
2004
ACM
16 years 21 days ago
2004
ACM
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
176
click to vote
JEA
1998
15 years 7 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
216
click to vote
TAMC
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
213
click to vote
SIGGRAPH
1989
ACM
15 years 11 months ago
1989
ACM
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...